Quicksort: Background & Python Code

preview_player
Показать описание
In this video we'll continue our series covering sorting algorithms by taking a look at the Quicksort. We'll begin by covering the basics and overall idea of the Quicksort, and, later we'll open up a coding editor and actually implement the algorithm using Python.

****

References:

End song is "Air Hockey Salon" by Chris Zabriskie
Рекомендации по теме
Комментарии
Автор

I've watched just about every quicksort video on YouTube. This one is by far the easiest to understand. Thanks for the great video!

Unwired
Автор

Without a doubt, the most efficient & simple quicksort algorithm. Thank you Brian.

alejandroescalante
Автор

Bro, what a implementation !! i saw almost 10 quick sort code, this is the easiest of all . thanks a lot !

mayurshitole
Автор

Hey ! It is a shame that you stopped doing videos but I want to praise you for explaining these sorting algorithms in a syntax that is way easier to understand than what people teach at universities !

filiphannel
Автор

Bravo, bravo! The best and easiest code i have ever seen for quick sort. +REP

yakup
Автор

Thank you for the video. I am grateful for your time and contribution. Kind regards, Akira.

akira_asahi
Автор

You just made me understand merge and quick sort with your respective videos on them. Thanks, man.

tomiwaobanla
Автор

Great video. The top search result on YT for quick sort python is far more complex than this one.

cpiersonk
Автор

Once again thanks for the post, 100% the best explanation I've seen.

Sindoku
Автор

Hey man great video, this is the best implementation I've seen thus far. Thank you for such a wonderful explanation.

ryankawall
Автор

This is an amazing tutorial! Really clear and concise.

tai-shanlin
Автор

This week I found your videos, for a topic that I really didn't understand and I just want to thank you for your work! you explain very well, I love to learn like this. Keep it up, you must upload videos transmitting your knowledge

laurapachon
Автор

ausammm . small and very easy to understand . thank you sooo much

ishikagarg
Автор

Hey man, great video! As you offered in the intro, could you show an in-place version of the algorithm?

Bardea
Автор

great great video thumbs up for ur simple but very efficient code

SARVDEEPSANGWAN
Автор

thnx
i've been struggling in python in school and this helps a ton
I just can't get loops
while, for, and recursive :(

Leo-yuzh
Автор

Thank you very much! Can you teach dynamic programming with some examples? Having some trouble coming up with the coding part...

s
Автор

for quicksort the worst space complexity is O(n) not O(logn) (logn is the best case auxiliary space complexity) 3:30

tmib
Автор

I got"maximum recursion depth exceeded while calling a Python object"
Any clue?brain

selftaught
Автор

suppose an interviewer asks me to code quicksort . can i use this in that scenario?

ravitanwar