In the partition algorithm, you could have used the left and right bounds from qs() function instead of doing it from 0 to n - 1 all the time. Why didnt you do this or am I totally off the track?
Hi! Good question. Looking for the kth smallest element in the initial array is like looking for the k-(p+1)st smallest element in the subarray starting on position p+1. This basically discards the p+1 smallest elements.
Thanks for your kind comment! I will consider doing Timsort in the future. Timsort is a smart tweak of a mix of merge sort and insertion sort, both of which are available on my channel, and you can watch these in the meantime.
![Gunna - HIM ALL ALONG [Official Visualizer]](http://i.ytimg.com/vi/HiCxoDeo0hc/mqdefault.jpg)
Best quick select explanation I’ve seen so far
Such an underrated channel!!!! Definitely recommending to my friends! Thanks a bunch!
Thanks! Glad it is helpful.
One of the most detailed video! Thanks man.
Thanks!
Good to see you active again. Your Quicksort Vid really helped me. Keep up the good work!
Thanks, your comment means a lot! I was active in the meantime as well, but it takes quite a bit of work to finish one of these.
Great and very lucid explanation. Will visit all the videos just for fun :)
Glad to hear that! Hope you enjoy the other videos as well.
Good job a lot of useful information from your channel I recommend to my friends
Thank you! Glad it was helpful.
Great animations. This is very helpful.
Glad it was helpful!
Great concept of a video! And well explained. I could only suggest to get a better microphone for quality and volume
Thanks! I am aiming at better audio quality for the next videos!
This is amazing. Thank you so much for a neat video.
Glad you enjoyed it!
Super informative. Thank you!!
Thanks! Watch out for new videos as well.
Great video! (Are you writing code on a typewriter? Half expected to hear a 'ding') 🤣
Great video, thank you
In the partition algorithm, you could have used the left and right bounds from qs() function instead of doing it from 0 to n - 1 all the time. Why didnt you do this or am I totally off the track?
Minute 5:36, if you do L++ why 1 and 7 swap in the video??
This video was amazing nice job
Thanks! I hope you enjoy my other video tutorials as well.
nicely explained .. I will definitely recommend this to my friends...very clever implementation
Thanks! Please do!
there's no way I will remember all of this in 6 months
Can anyone explain why in the else block in place of k he did k- p+1 .Its getting over my head.
Hi! Good question. Looking for the kth smallest element in the initial array is like looking for the k-(p+1)st smallest element in the subarray starting on position p+1. This basically discards the p+1 smallest elements.
Good explanation!
Thanks! Hope you enjoyed it!
In 7:48 I guess there's an error in code.
Why the first argument is
'T + p +1' ? It should probably just be T.
why no implementation with randomnes?
Hello! I explain how to add in the randomness at 15:45. Is this what you are looking for?
@@TrulyUnderstandingAlgorithms Oh mistake!
Even when adding the random part I still get "time limit exceeded" on leetcode :(.
@@BlumChoi So what is the code you are using?
Very great video, but can you slowed down the pace, it would really helpful.This channel gives me vibe of 3blue1brown
Keep it up!!!
Thanks! I will keep a slower pace in mind for future videos.
Lucid explanations. Thank you. Could you do the same for Timsort algorithm?
Thanks for your kind comment! I will consider doing Timsort in the future. Timsort is a smart tweak of a mix of merge sort and insertion sort, both of which are available on my channel, and you can watch these in the meantime.
Truly Understanding Insertion Sort: ruclips.net/video/jF-8RcO_9ds/видео.html
Truly Understanding Merge Sort: ruclips.net/video/HpPr0t8ieQ4/видео.html
gracias
Thanks!
Must watch
Thanks! I am glad you have found it useful.
Please use proper mic. Btw nice explaination.
Thanks! I still have to work on audio.
you go way too fast.... t down