@jcjeong
Thank you so much for taking the time to do this! PS instead of swap function, easy way to swap array elements in ES6 is: [ arr[a], arr[b] ] = [ arr[b], arr[a] ];
@minijimi
Good job, I like the fact you made a plan on the white board and then implemented it. Of course it will not work the first time, things take time to debug and optimize.
@MajorMandyKitten
Can I just say that I always appreciate your videos? they're super inspiring!
@hrishikeshaddagatla4789
What if I want to display number text on rectangular bars?
@leonsoler3822
Great video Daniel! id love to see mergesort visualization, greetings from Argentina!!
@rsvdark_main
24:49 shouldn't this use states[i+start] again?
@domninin
Have you ever thought about making a video on the topic of Case Based Reasoning? I think it could be pretty interesting, maybe have a game like Tetris or Snake and have a CBR algorithm learn from your behavior. Love your videos, keep it up :)
@borschetsky
Hey! Nice! This video should be at trends:-) Thanks to you I’ve finally understood the classic quickSort implementation with memory complexity 0(n).
@TheHawk3r
Great Video. Really having a bad time with recursiveness and sorting algorithms. But this channel helps me a lot. Have a great day mister!
@efflogz5216
Nice video as always, could you please do radix sort now?
@Qgleuo
Wow, you are an amazing teacher!
@Erik31415
Your editor is a genious
@evolutionxbox
I just listened to the @basecs podcast episode all about this!
@funnyanimalworld7579
It is really easy to do
@samuelborn9004
What's the ide he is using in this video?
@teit-9_piyushbhujbal66
Bro, why you always use javascript in each coding problem?
@neuralwarp
Now js has been improved, you should do some flood fill algorithms
@sitalsitoula6536
Where is he calling the draw() function
@foxmulderqqs
First
@mayankmani545