I'm using this while making a programming language, and I have to say, you are the best explainer of these algorithms. Great work, and thank you for the tutorial!!
Great job, Kurt! Your explanation has all 3 qualities that make great educational content. First, they are very 'linear' - which means, each thing flows logically into the next. Second, you've made them very clear by helping us visualize the algorithm. And third, they are fun and energizing. I try to write simple explanations of AI papers myself, and some of them have done well (the last one was featured in Gizmodo and Business Insider: www.businessinsider.com.au/how-alphago-beat-human-go-players-2018-3). Maybe we can collaborate in future - if you'd be interested in that, let me know!
@@compsciin5932 No problem dude, you solved it in the next Video (Postfix to Infix), anyway in both video you were amazing, Don't forget to continue :)
![[LIVE] : ONE ลุมพินี 76 | คู่เอก "ผึ้งหลวง vs สมิงดำ"](http://i.ytimg.com/vi/9SBshmGQOIM/mqdefault.jpg)
That's the most brilliant explanation of this algorithms I saw
Thanks bro! Tried to keep it short and simple with some nice visuals
These (shunting yard & post-fix evaluator) are very good. You should pick this channel back up if you have the time. Thanks for this!
You know what, I just might. I have taken a break doing other things and am almost done with my PhD. Perhaps I will make more CompSci in 5s
Dude you are a life saver
Haha I am glad it helped out. I made these for a workshop group and thought I’d share them with everyone
I'm using this while making a programming language, and I have to say, you are the best explainer of these algorithms. Great work, and thank you for the tutorial!!
You’re very welcome!
Extremely good, just great!! Thanks.
Amazing, thank you very much!
Just wanted to thank you. Just had to implement this algorithm for building a AST as part of a compiler assignment. Kudos to you
great explanation, thanks for sharing
My pleasure, Glad it was useful!
Your videos explain very well the Shunt yard algorithm. Thanks a lot!
You are most welcome!
Your welcome! My pleasure
Thanks a ton. Was trying to understand this part of the algorithm but it's nowhere on the Wiki page so this was super helpful.
Very nice explanation just like your previous video of shunting yard algorithm
Thank you very much
Your explanation really helped me. Thanks a lot.
You are most welcome
thanks
Did no one recognize that there is the "2" missing in the previous video? o.O
Thanks!
Your welcome!
boss!
Great job, Kurt! Your explanation has all 3 qualities that make great educational content. First, they are very 'linear' - which means, each thing flows logically into the next. Second, you've made them very clear by helping us visualize the algorithm. And third, they are fun and energizing. I try to write simple explanations of AI papers myself, and some of them have done well (the last one was featured in Gizmodo and Business Insider: www.businessinsider.com.au/how-alphago-beat-human-go-players-2018-3). Maybe we can collaborate in future - if you'd be interested in that, let me know!
Absolutely we could collaborate! Thank you so much for the compliment. I seriously appreciate it to the highest degree.
Cool! Let me try sending you a private message.
dope
Excuse me sir, in this simple example can it handle variables or you need to change it?
Would need to change it to handle more complex expressions
it's great explanation, but you have an extra Multiplication though, I guess. you missed a number, but Thank you
Yeah, I think the paper fell off the table or something or I just made a mistake haha
@@compsciin5932 No problem dude, you solved it in the next Video (Postfix to Infix), anyway in both video you were amazing,
Don't forget to continue :)
make parenthèse pls
That is when things get more complicated lol
hickey!
hehehehehe Comp Sci guys get all the chicks :p