Видео

glad for ur effort sir

Dude you are so great when are new videos coming?

Amazing, thank you very much!

Computer science students are missing this Trésor

nice video thanks

Extremely good, just great!! Thanks.

What is the precedence of logical operators "||" and "&&"

Dude you are a life saver

thanks

Buen video

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.

Awesome visualization, but how do you evaluate the RPN if there's two operators in a row? e.g. in your example you have 5,4,*,3,*,+,1,- So we multiply 4 and 5 together, then take the result and multiply it with 3, then take that result and add it to what exactly?

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!!

yes 2023 we are here

great explanation, thanks for sharing

Why (5*4+3*)-1?

These (shunting yard & post-fix evaluator) are very good. You should pick this channel back up if you have the time. Thanks for this!

Thank you!

Excellent visual explanation. I inherited a class project that utilizes this algorithm so I'll be referring to this video often! Much appreciation.

Did no one recognize that there is the "2" missing in the previous video? o.O

Amazing!

good stuff. i liked your energy

Very nice explanation just like your previous video of shunting yard algorithm

Sir You made this algorithm very easy to visualize, Great explanation

Concise video, great stuff! Cheers

thank you for your clear explanations

boss!

What if we push sin ,cos

you are a god to us mortal compsci students. god bless your soul.

Those videos are so underrated. Your enthusiasm and desire to teach, in a funny way too, is one of the rarest things ever. Thank you, sir.

Omg! It was sooo good. How about functions, unary operators and composite functions? I would love to see some practical examples:D

Just wanted to thank you. Just had to implement this algorithm for building a AST as part of a compiler assignment. Kudos to you

thank you so much this was very helpful - but just a quick question - what is the purpose of this? Like why does it do this? And if we relate it to the algorithm, such as I am thinking of the youtube algorithm, how does this relate?

Best explanation ever, better then my teachers explanation :D

thanks sir

Isn't your infix expression invalid? There is a random multiplication hanging out between the '3' and the ')'. If I'm incorrect, please explain for me. Thanks.

excellent video.

it's great explanation, but you have an extra Multiplication though, I guess. you missed a number, but Thank you

Best explanation ever

The visual representation here is very helpful! Thank you!

Amazing video you created! Thanks so much

that intro was earrape

AdventOfCode2020 participants, welcome!

thanks a lot man . I passed the exam with this video.

Excuse me sir, in this simple example can it handle variables or you need to change it?

make parenthèse pls <3

lol what was with the intro? XD

did a playstation turn on at 6:05??

Great and all but it is rather annoying that it wasnt 100% clear that - - also should be pushed to the postfix like this: 3-1-1 Is 31-1- And not 311-- as i assumed. I only noticed after my code gabe me the wrong result. Same goes for /* , */, +- and -+. At least for me.

Dude, that shout at the beginning was freaking horrible! Whhhhhyyyy???!!! Other than that, it's a very informative video.