Quicksort (In-place): Background & Python Code

In this video we'll take another look at the efficient Quicksort algorithm, specifically, we'll reimplement our prior approach to run in-place. After coding up our new solution, we'll compare the runtime performance of the in-place version, against the version we developed in the prior video.

****

References:

End song is "when" by Stephan Siebert

[mbabb]

A fantastic video. Thank you for this!

In all of your videos, I really enjoy how you do not rely much (if at all) on external libraries to demonstrate the given algorithm. I find that this makes the underlying algorithm easier to understand, as it shows all of what is going on (no magic involved!).

Please do continue this series! Thanks again!

[sannapersson]

Thank you for the video, have been looking everywhere for a simple inplace implementation!

[kahdojay]

love that ending piano music with the coding / sound in the background - could make for a nice intro!

[mr_karamazov]

High quality explanation and benchmark testing.

[johnbkangarlu]

great video man! Your videos are super helpful - your channel is now one of my go-to's for python and algorithms :)

[aquasaiyan]

i'm visiting this every time for interview.

[marvinbeese]

a little bit fast explained but a very smooth editing. :) keep up the good work

[คณัฐตังติสานนท์]

greate video. it's really helpful but "maximum recursion depth exceeded in comparison" when I use sizes
Is there a way to solve this issue?

[nashaeshire]

Great code + great animation => Great course. I just rewrite the variable for more clearer ones. You should think about making a python algoritm course on udemy. Just need more algorithms and a better microphone ;)
I love what you do.

[rathoresahab]

There is syntax error in pycharm and jupyter notebook
Error is unsupported format of print

[atharvaprabhune]

but we aren't returning a here. So how can be it printed

[miunify]

Please don't be this guy, defining variables like that...