this is the cleanest implementation of quicksort that I have seen. period. So easy to follow! Subscribed

This is the best explanation I have seen so far. It’s like other people try to explain things in the hardest way possible so you could think they’re more smart lol

Hey man, you are one of the most underrated channels on youtube for Python. It is sad to see you haven't uploaded in a while, but I hope everything is going well for you. Thank you for all you have done.

I wish every video on the internet was like this. You made my day, for real.

Why is this dude so underrated . I was searching for tutorials of sorting algorithms I didn't find a single video which explained well and mostly all the sorting videos were about bubble sort . Now after 2 days his video come to my recommendation.And yeah bro keep up the good work I can't even explain how much these sorting tutorials helped me keep it up . You will surely get what you deserve once👍👍😁

Quick sort is generally in-place, and your implementation, while simple to understand, is isn't which means it would have a disastrous memory footprint for larger input sets.

Although it isn't in-place, your tutorial was very simple to understand and should definitely be how Quicksort ought to be taught!

man ur amazing, understood first time quick sort in my life

Oh my god !! The best video of quick sort ! This is the first time I visited your channel and I'm totally recommending this to all my friends !!! thanks s lot ❤️❤️

Great tutorial! However, quicksort is an in-place algorithm. This implementation is not in-place since it creates new lists rather than modifying the original. The in-place version is naturally a bit trickier, which is why most people seem to get your version better. Nevertheless, this video does a great job in explaining the intuition behind the algorithm.

just found this channel rn and this dude is so easy to understand and chill (but not boring) untapped resource of knowledge right here

this is the BEST explanation of quicksort, EVER.

I'd definitely recommend this channel to everyone who wants to learn DSA in a very clear and easy-to-understand way. Thanks Derick Sherrill for this tutorial. Keep posting more and more videos

Man this is by far the best explanation, i wasted my time on so many videos. Thanks man

Thank you, I understood the algorithm in the first 2 minutes of the video.

Nothing beats the smell of clean code in the morning. Great job, very clean code.

That was an incredible explanation, man. That's pure elegance.

I appreciate that you take pains to make the coding easy to read. Many coding videos are essentially useless because the presenter doesn't magnify the code.

I have finally found a clear, well explain and simple answer to my questions. Ty very much.

Bro, this is the best explanation and small and eficient code i've ever seen so far

This was incredible. Thank you for explaining these algorithms in simple terms for beginners to understand. Your explanations are clear and your code clean. Cannot be thankful enough.

Most clear and straight explanation..... Thanks..... I just came across a one liner of quick sort in python.... Now I think I will be able to understand it. Thanks a lot!!

Thanks, you have no idea how much this helps.

With all that animation and description, it was great. So clean. I'm a beginner at programming and yet all this made complete sense. Thanks, man. Subscribed.

Strongly recommend this video for beginners. Cute guy and great teacher, what else would u ask for XD. More seriously now, short video with good editing going straight to the point and explaining this concept in a simple way. Thank you man, keep it up.

Where were you, Derrick...you saved my life. best of best programming video so far.

The simplicity of this is divine..... Thank you so much

You wrote this algorithm more clearly than anyone else I've seen

This is the best, cleanest, efficient and the most beginner friendly quick sort algorithm i've stumbled upon. Thanks my man!

I was like keep on looking into many youtube videos to find a perfect video for quick sort then landed over here and got the most easiest and understandable way to code it in python for the quick sort !!

this kind of videos i wish i found for every algorithm i am searching.. 1) sort..really sort 2) straight to the explanation with example with nice visuals 3) code, simple and 1 to 1 match with the example and without any fancy and useless coding elements

Amazing explanation!!!!!!!! Much better than what my TA's and Prof did in a whole week.. you did it in 6 minutes!!!! Thank you~~

WHOA 🤯🤯 HOW COULD YOU MAKE IT SO EASY TO UNDERSTAND !!!!!

You explained it perfectly in 6 minutes can't argue that this is content with value got my sub

Bro keep doing what you're doing I spent like an hour trying to understand quicksort, and the code to implement it, and I got it after 5 minutes of your video!

Amazing, after watching so many videos... I finally got it! so underrated tutorial

The best explanation I found on the internet… thanks a lot!

This gotta be the awesomest explanation about quick sort, great job Derrick keep up the good work, i hope to see more data structures and algorithms tutorials from you!!!

this is certainly one of your top drawer explanantions

Quicksort is an in-place sorting algorithm. It is supposed not to take any additional space.

Man ur a freaking genius May God bless u abdundantly

best quicksort video on this planet thanks bro

first time was able to understand this algo....loved it...

after going over 4-5 paid rock hard explanations I found your channel....liked, shared, subscribed faster than any sorting algorithm :P

Thanks for making it a piece of cake man, cheers.

Wtf man I'm literally stunned on how easy you made it.

I've my university prac exam tomorrow and U JUST FU*KING NAILED IT MAN!!!!!! YEAH, U ALSO EARNED A SUB!!!!

I have watched multiple quicksort videos and so far this is the best and the cleanest explanation I have seen so far 👍

for i in range(1, infinity): print("THANK YOU!!")

if i was rich i would have donated 10,000 dollars to you for this best explanation of quick sort. Thank you Derrick sherrill. God Bless you

I kept thinking, I know I'm not stupid. I know I understand the logic. Why can't I understand anyone's CODE? and then I found this video. This code & your explanation is EXACTLY how my brain works and understands it. thank you for rocking.

oh my god man thank you!!! I wasted my afternoon watching quicksort animations and I finally understand it

Hi, Derrick! Thanks for your explanation, it was very helpful :) Anyway I found a small bug in your implementation. As you `pop()` to extract the pivot from the list, the values from the original list are modified. This causes that if the input array is already sorted you loose the pivot, which is your case is the last position. For a real code example of the situation, look at the following assertion: `quick_sort([1, 2, 3, 4, 5, 6, 7]) == [1, 2, 3, 4, 5, 6]` (note that the 7 is missing). This can be solved by using an operation that does not affect the original variable outside of the function's scope, like this two line version of pop: ``` pivot = sequence[-1] sequence = sequence[:-1] ``` Regards!

My God I've been searching for hours for an easy coding solution to follow. Your vid literally saved me! Thank you so much

Wow that was amazingly simple. I learned this a while ago in college, but my teacher made it a 3 week process that was beyond confusing. That was so clean and simple. Great job. I immediately subscribed.

Oh my god! this is the best and easiest solution of quicksort, thank you so much.

Thanks sir! I have seen various implementations of quick sort that literally made no sense to me, until I saw your explanation. That is really an awesome implementation. If I say thanks 100 times, that would still not enough. Keep up the good work, sir!

Hi Derrick, Thanks for wonderful and simple explanation of the quick sort algorithms. Never understood the quick sort much better. Could you also please explain time and space complexity of the algo that you explain. Then it would be more clear to understand advantage of one over other. Thanks again

this is the most underrated channel i have ever seen .Keep up the good work man

This is one of the cleaner implementation of all the quicksort I've seen

Ohhhhhh your code logic simplicity is really awesome derrick

FANTASTIC TUTORIAL! I always thought quick sort was the hardest, but your video helped me learn it thoroughly. Tysm!

You are making coding easier for me. Thank you.

just finished mosh's python course...was interested in algorithms for sorting and graphing(searching)... Great video, well explained, thanks mate!

This tutorial is the clearest description of the quick sort algorithm that I found on KZfaq. Can you add a discussion of why the time complexity if nlogn, please?

Absolute amazing! Your tutorial is the best and most understandable I have ever watched!

Great, really simple and easy to follow explanation, thanks Derrick.

Thank you for this. I wish I saw this prior to my coding interviews. New subscriber here

Excellent explanation...I went through multiple videos about quick sorting & Hands down , this one is the best !!

This pythin solution was soooooo much easier to understand! Thank you!

you ar ethe best-est teacher I can ever imagine...thank you ...!

Superb one ☝️ even our lecturer was unable to give complete idea and unable to gave a code like this simple. it was very complicated i gave it up then searched and fined this what an algorithm great keep your good work😊❤️

Thank you so much specially for simplifying it to such an extent. Artistic elegance!

The best. Dropping a like. Subscribed. Suggested your channel to my friends. Keep doing more videos like this !

You deserve likes and comments and subscriber. Keep going and growing,

Hi Derrick, Thanks for wonderful and simple explanation of the quick sort algorithms. Never understood the quick sort much better.

The best video for quick sort explanation!!! Clean and clear! theoretical and practical!

I don't normally comment on the video. This is by far an easier explanation to quicksort.

Amazing explination! Most of the other tutorials are so hard to follow. Subscribed!

Was thinking of making a sorting visualiser project. Now I can code this in JavaScript for sure. Thanks man!

Wow, it looked so complicated and you just made it simple! Amazing, thanks a lot.

great man this is one of the easiest quick sort algo i've ever seen....liked and subscribed

I am understanding this video as quickly as quick sort

Awesome man awesome ...... I never see that easiest explanation on KZfaq...... But damm absolutely great.....

this channel is amazing, had trouble understanding my lecturer but this was super clear!

I am a beginner in ds algo...after seeing another video thought of quiting as I couldn't understand properly but ur videos now made me wanting to learn more...how amazing explanations man🙏🙏

nice explanation! We need merge sort and heap sort videos as well.

Amazing Derrick, learned alot! Thank you from freezing NYC

awesome bro, very helpful to understand quick sort behind the scene. marvelous. But if the space complexity matter the most, we could struggle with your algorithm, since quick sort should be an in-place algo. But this is the best intuitive explanation of quick sort I have ever seen. Awesome

U R D Man, many thanks, others explain logarithm over half hour and still struggle to understand, urs short, clear and easy thank you subscribed. please make video of merge sort as well if possible. thank you

This implementation is also good. def quick_sort(arr): if len(arr) pivot] return quick_sort(left) + middle + quick_sort(right)

recursive function i see, pretty clever although not that efficient with much more values, it is still pretty impressive to see that's quite simple

thank you very much, this was the best implementation i could find and the easier to understand

Thank you for your concise and easy to understand implementation Derrick. Very good videos. Thanks!

Awesome videos Man!! One of the Simplest explanations on the internet

Such a good and simple way of explaining quick sort! Thank you for sharing!!

Agree with the comments below. I was trying to understand the implementation from "The Practice of Programming" but quickly got confused trying to reimplement their version from C to python. Watching your video breaking down the concepts I got it right away. Many thanks for this video

I understand pivot in 1st attempt,..thanks bro

Greatest video ever on quick sort

Subscribed!!! Very clean and concise explanation!! Im just starting out with algorithms yet you explained it very well :D keep going buddy!