Quicksort (In-place): Background & Python Code

Подписаться 13 тыс.

Просмотров 17 тыс.

50% 1

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.
► Prior Quicksort Lesson (mentioned in video): • Quicksort: Background ...
****
► Python Data Structures: • Python Data Structures...
► Video series covering GUI development in Python (WIP): • Python GUI Development...
References:
[1] en.wikipedia.org/wiki/Quicksort
[2] www.geeksforgeeks.org/quick-sort/
End song is "when" by Stephan Siebert

Опубликовано:

16 ноя 2017

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 24

@mbabb 6 лет назад

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!

@kahdojay 6 лет назад

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

@sannapersson968 3 года назад

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

@mr_karamazov246 4 года назад

High quality explanation and benchmark testing.

@eytchde 6 лет назад

great vid, keep em comin

@johnbkangarlu6197 6 лет назад

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

@BrianFaure1 6 лет назад

Thanks so much John!

@Bardea 6 лет назад

of course! Would you be able to cover the Convex Hull / Graham Scan algorithm in another video? That would be a cool application of sorting algorithms

@BrianFaure1 6 лет назад

Certainly, that seems like a really interesting application.

@Bardea 6 лет назад

awesome, I look forward!

@aquasaiyan7877 3 года назад

i'm visiting this every time for interview.

@marvinbeese8180 6 лет назад

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

@martinrussell1404 5 лет назад

Thank you!

@arishtj 2 года назад

how are you not a rapper. damn ❤‍🔥

@Eduardo-hv1yh 4 года назад

wow!

@nashaeshire6534 4 года назад

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.

@user-qm8qz7vd9k 4 года назад

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

@rathoresahab4667 4 года назад

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

@denissea9067 6 лет назад

Will you be doing Heap Sort video?

@BrianFaure1 6 лет назад

Added it to the queue, thanks for the suggestion!

@atharvaprabhune8815 6 лет назад

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

@BrianFaure1 6 лет назад

Hi Atharva, we don't need to return anything because the function is designed to make all changes to the original input array. In Python if you pass a mutable object such as a list (more info here: stackoverflow.com/questions/8056130/immutable-vs-mutable-types ) to a function you can make changes to it inside the function and they will persist even after the function has finished completion. This is similar to if you passed a pointer or reference to an object to a function in another language such as C or C++.