QUICK SORT | Sorting Algorithms | DSA | GeeksforGeeks

not the best i watched

I'm not sure if light green and white are the most eye-comfortable colors to read haha

thanls

The video sound is too irritating.

Love it

The explanation is pretty good watching it on my TV I can barely see the white text on the lake green background

Thanks

I feel it uses 2 pointer approach, we use i +1 to swap w larger values.

awsm

Quicksort will always be the most difficult sorting algo to explain, not very intuitive and too much index management. Ty for the video.

quick sort is so confusing to understand. How are pivots chosen?

Impossible to understand with this background music

What if the least element is at the end of the array? Then considering it as the pivot element no swapping would occur as A[i] would not be <=pivot, then what happens to the first iteration?

The background music is bullshit...🙂😡

great video thanks

Thanks for visuallizing this :)

Wow, thanks GeeksforGeeks!

If you're wondering why partition works:, this is sort of a proof that helped me understand

1) Fact: every element up to l is smaller than 70.
explanation: if an element was smaller than 70 we swapped it to the the value of l at the time. the l value was everything
between 0 and current l. (the main thing you have to understand, the rest comes from it)



2)Fact: There are exactly l+1 elements below 70
explanation: With J we went over every item in the array exactly once. every time an item below 70 was encountered we "l++ 'd" if an item below 70 was encountered

Conclusion 1 : Since every item at l or below is smaller than 70 and there are exactly l+1 items in those locations and l+1 items below 70.:
Every element at l or below is less than 70.
Conclusion2: Every item above l is more than 70. (immediate from conclusion 1)

No Platform can ever compete geeksforgeeks

3 awesome 👌 minutes
Keep going on 🤟

Awesome ,thanks 👌

everything is great in this video but the colour of background is just eye fckng 😵😵‍💫

Song name?

I have some douts:(

Substandard video. Not satisfied

GOAT!

thank you million times

i dont like this video becuse there are no calling recursivly to the function in diagram

Swap function should be written before i++ (increment)

Sorry but this is damn poor presentation about quick Sort Algorithm...

after reading the related part in the Grokking Algorithms book, i have to admit the explanation in this video is absolute garbage.

its confusing.....stopping the in he middle of it and moving on....!

okka mukka ardam italed ra nayana

This video is good for doing work out not for learning quick sort

public class QucikSort {
static void Sort(int arr[],int low,int high) {
if(low>high) return;
int mid = low+(low+high)/2;
int pivot = arr[mid];
int i = low;
int j = high;
while(i<j) {
while(arr[i]<pivot) {i++;}
while (arr[j]>pivot) {j--;}
if(i<=j) {
int temp =arr[i];
arr[i]= arr[j];
arr[j]= temp;
i++;
j--;

}
}
if(low<j)
Sort(arr,low,j);
if(high>i)
Sort(arr,i,high);
}
public static void main(String args[]) {
int arr[] = {5,8,45,3,54,8,3,5,31,4,21,2,5,1}; //hardcode
System.out.print("Before quick sorting:");
for(int i=0;i<arr.length;i++) {
System.out.print(" " +arr[i]); //loop for printing array
}
System.out.println(); // print statement for printing it on nextline;
Sort(arr, 0, arr.length-1);
System.out.print("After quick sorting:");
for(int i=0;i<arr.length;i++) {
System.out.print(" "+arr[i]);////loop for printing array
}

}
}

sir iam getting stack overflow error plz help me stuck with my code
below is my error
Exception in thread "main" java.lang.StackOverflowError
at QucikSort.Sort(QucikSort.java:21)
at QucikSort.Sort(QucikSort.java:21)
at QucikSort.Sort(QucikSort.java:21)
at QucikSort.Sort(QucikSort.java:21)

I don't know if this video follows quick sort or not,
but when I look at the quicksort flow chart, I created a faster one.

These visuals by gfg makes life a lot easier.

Please change the background colour

this video to fast and the music ruins the mood to grasp, good video though

my Gosh. After 3 days of watching videos and trying myself finally I got how this code works.
This is the only video worth watching. Thank you so much.

Good explanation under 3 mints, thanks

Thanks

Why have u included such sound it's an algorithm video not a DIY kind of stuffs🙂🙂

please don't add music

Thank u, i understood this algorithm.

Had to watch this on mute

The color.white.is.not appearing.on.light green