RIP

The call stack visualisation @ 9mins or thereabouts is a really nice way to illustrate how recursive calls are paused to allow the further recursive calls to complete. This has been the biggest issue I've had in trying to get fully comfortable with recursion as I'm forever trying to track them all in the head!

at 7:41, i think there's a bug. the blue while loops, if the leftover are sorted, things will be fine. but if not, then the leftover will not be sorted. For example if the array is [1,2,4,6,3,5,8,7], the result will be [1,2,3,4,5,6,8,7]

Thanks for teaching and i could say ur the best teacher in data structure and algorithm i‘ve ever met.Sorry to hear the bad news,but i am really thankful.

This is a great video explanation. Thank you. However, I have a doubt though. By the time, the compilation is over, the program no longer exists in the high-level code. It gets converted to assembly-level code with no variables, objects, methods and so forth. Just mnemonics, registers and stuff. So, when a program (executable) gets executed, the image of executable created in the primary memory, the process memory is going to contain only assembly-level code in the text section. What resides in the process memory must be just assembly-level code. Is the illustration here correct? Also, the initialized data and uninitialized data are not variables or objects in HLL, but identifiers and registers in ASL. Can you please clarify if what I am thinking is right or wrong? Similarly, the activation record for each function stored on the stack, should have to do a variable-reference name binding using something called as symbol table or something. Otherwise how would p be mapped to 200? Can you point to some resources that might be used to explore more in this regard?

Thanks for the analysis! I have a quick question: I have a SafePal wallet with USDT, and I have the seed phrase. (behave today finger ski upon boy assault summer exhaust beauty stereo over). What's the best way to send them to Binance?

00:03 Binary search tree is an efficient structure for quick search and update. 02:40 Array vs Linked List operations 05:04 Binary search provides efficient search operations on sorted arrays. 07:30 Binary search tree allows for log n cost 10:14 Nodes in a Binary Search Tree have specific value relationships 12:38 Binary search involves recursively reducing the search space by comparing with the median element. 15:05 Binary Search Tree search involves traversal reducing search space at each step 17:28 Binary search tree allows for efficient insertion and deletion of nodes.

this channel is just amazing, up there with the best cs channels in the world

Simple but great explanation, thanks

Rest in peace, Harsha Suryanarayana. You are the best coder and best teacher in my heart.

after harsha this channel didnt died we still respect and remember you freecodecamp let your passion to reach beginners like us <3 thnaks for everything you did for us thanks for being one of the starting brick of our career mycodeschool and thanks Animesh and Harsha

Thanks so much! this was so useful

Prime level of teaching that no one can't even touch

His explanation make me love for coding. I'm still shock for his tragic loss a gem programmer community just lost.

2024

Thank you so much for such amazing content!

"exectuin is paused" - most important phrase used in the video

To be honest my feeling is exactly when i watched the last episode of Friends or The big bang theory.

Its really hitting differently and making me sad to know this is the last video of this playlist.

September 2024, Still there is no Sorting algorithm playlist better than this one, it has been 11 years

Finally found the best explanation of level order traversal

How about using a hashset in the adjacency list , instead of a linked list or a BST?

10 years ago, Really better explanation than 2 hour lecture

Anyone in 2024🎉

2024 o cara manda muito

Johnson Ronald Allen Steven Lopez Betty

Gonzalez David Robinson Mark Thompson Cynthia

plzzz why not cpp

Any one tell me is this the last video of c lang??

can naybody exaplain me why we are writing rettrun root in insert function

thanks for the clear lesson

You are a proof that not every indian accent video is a bad video.

“I have always liked the stories where an underdog wins. I just want to be part of one of those stories.”, A great teacher once said. Rest in Peace, Sir.

thanks!

thank you so much bro

BRUHHHH

A gem, even after 11 years.

Saw this in 2024, still better than others. thank you mycodeschool for this... Hat's off!

i have seen your video on Free Code camp , I read the comment section and came here . Thank you so much for helping

great!!!

Very good explanation, thanks a lot!

Thank you sir

You will never see this comment, but I want to say thank you for the tutorial. Rest in peace.

nice explation sir . from iit bombay cse

11 years old video saving my ass today

I watched the whole series, so awesome.

Incredible explanation

your explanation and coverage of examples are very good sir,, Thank you

It would be a good idea to use the name Edge for the Node data structure.

You just wrote the second loop without any explanation, that's BS man.