JavaScript Algorithms - 25 - Quick Sort Solution

📱 Follow Codevolution

Quick Sort Solution
JavaScript Algorithms
Algorithms with JavaScript

[spongebob_nypd]

These kinds of tutorials really bring a smile to my face for both simplicity and effectiveness. Thank you making this tutorial, it really helps in our classes :D

[oscaranillo]

Your quicksort algorithm is one of the shortest and efective one I've ever seen! Keep up the great job!

[zabiiaryan]

I really appreciate it. I have CS degree but still was struggling with untying the knots of the algorithms but your videos made me grasped these at fly. Thank you.

[enriquegrageda]

Yes, simple solution, my brain can finally relax haha
thanks my bro😁

[alepiga]

thanks for this video!!! i have an IT test about this tmrw, ill update you on my grade lol

[saikrishnamanubolu]

Great tutorial nice to learn one by one

[josephuzuegbu]

this is the best way to learn DSA. THANKS SIR

[trainingceh]

No words sir you have done great video

[VlogsByAnubhav]

Where is the link for the code? if we want to achieve the same with space constraint. As mentioned at 4:55

[kidsNurseryPoem]

Brilliantly explained even though I have a problem understanding algorithms I can understand easily

[djneils]

I had hoped you'd give a solution that does the sorting in-place (i.e doesn't generate lots of new arrays)

[arashforghanbin]

Why is the pivot chosen is the last element and not the median one?

[manickamsubramanian]

is there any option to give 1000 likes in YT?? So far the best video regarding algorithms

[josephjohnson]

I followed along and got a maximum call stack size exceeded error. My code was exactly like his. when I copied and pasted his code into my ide it worked just fine. After I did that, I deleted his code and ran mine again and it worked just fine. anyone ever have that issue?

[vaibhavsharma]

First of all thanks for the whole DSA series. You teaching style is so good. But I noticed one thing in Quick sort solution when I give input this array [-1, -8, 100, 19, 21, 7, 1, 2, 1, 1, 3]) it returns the sorted array but the elements are not on the same location -

Here is the output - [
-1, 1, 2, 3, 4,
6, 7, 10, 2, 1,
100

Any idea why it is giving wrong output?

[syedfaheem]

Since you're creating new arrays, in your case the space complexity won't be O(1) as opposed to just passing the pointers.

[hjnl]

Thanks so much,
But why this code doesn't work when I assign pivot to any other value in the array but not the last one?

[afsalpt]

can you explain why you take array.length <2 at the top

[abhishekbharti]

Funny Story is...Initially when I started watching your video I didn't liked your voice...But the way you explain things in short and simple manner...I'm your fan...This playlist is very underrated...it's a gem

[Mystique_Gohan]

can you explain why the worst case is o(n^2) even though we had only one loop