Truly Understanding Quick Select

Understand the Quick Select algorithm using an easy-to-follow visual animation.

See how to implement in C in a step-by-step manner.

Understand why it takes time O(n) on average and O(n²) in the worst case.

See how adding in some randomness improves the running time guarantee.

Check out some of our other videos:

[rajatshukla]

Such an underrated channel!!!! Definitely recommending to my friends! Thanks a bunch!

[betoharres]

there's no way I will remember all of this in 6 months

[tejassameera]

Best quick select explanation I’ve seen so far

[saketkishor]

Great and very lucid explanation. Will visit all the videos just for fun :)

[kadelchess]

Good to see you active again. Your Quicksort Vid really helped me. Keep up the good work!

[suyashgupta]

One of the most detailed video! Thanks man.

[mogilimanikanta]

Good job a lot of useful information from your channel I recommend to my friends

[spicy]

This is amazing. Thank you so much for a neat video.

[paumore]

Great animations. This is very helpful.

[huynhduc]

Very good explanation. But I suggest getting a better mic. Some parts are very hard to understand but your explanations are clear.

[KaliPuppies]

Minute 5:36, if you do L++ why 1 and 7 swap in the video??

[kamilstars]

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.

[hadaskate]

Great concept of a video! And well explained. I could only suggest to get a better microphone for quality and volume

[gergerger]

Great video! (Are you writing code on a typewriter? Half expected to hear a 'ding') 🤣

[NamanSharma-zxgq]

nicely explained .. I will definitely recommend this to my friends...very clever implementation

[bismansingh]

Very great video, but can you slowed down the pace, it would really helpful.This channel gives me vibe of 3blue1brown
Keep it up!!!

[subramanyah]

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?

[rudranshagg]

Can anyone explain why in the else block in place of k he did k- p+1 .Its getting over my head.

[AnindyaDey]

Lucid explanations. Thank you. Could you do the same for Timsort algorithm?

[Myshkin]

Please use proper mic. Btw nice explaination.