Thanks for the valuable content sir. Sir your algorithm is very simpler than geeks for geeks also. Always you make things easier to understand. Once again thank you sir 🙏🙏🙏
Sir at 22:43 (a[j]>pivot, this condition is going on), pivot is initially 10 but you took 20 as pivot and and did10>20 which is wrong.cause after decrementing j is at 0th index which is 10 and pivot is also 10 so it should be 10>10
You have an eagles eye, He made a mistake but the outcome is 'false' just as he stated, invariably, he's correct ... (10>10 ,10 is not greater than 10 so it is 'false'). Therefore, 10 is j and also the pivot, it can't be swapped. Recall, when i > j, j =0 and i = 1. swap( a[j],pivot) .
Sir I have a doubt. I have problem with my function to find pivot position.And my input={60,50,40,30,20,10} output comes like {0,20,30,40,50,60}. And the code is int findpivot(int arr[],int low,int high)//FINDING PIVOT POSITION { int pivot=low; int i=low+1,j=high,temp; if(i
Hi sir ur vedios r awesome easy to understand . Data structures and algorithms in c programming I want parsing arithmetic expression Plzzz do the vedio sir
Sir u r making us confuse with pivot values...u r saying that..30 is pivot value . At the same time u r saying that.. starting value is pivot .. make it clear
You are correct. it should not be 10>20, although he said it's false which is right, 10>10 will also be 'false' because 10 is not greater than 10. So it's also false.
hi i think you have missed the declaration part for function quicksort() so declare the function and your problem will be solved. Thanks for your interest and support towards our channel.
Great explanation, best on the net, thanks alot, i checked many tutorial but i did not have any clue , but u described precisely
Sir can u explain the quick sort program in next video...
You always try to make things simple!
I'm actually searching for your video ❤
Sir, u gave condition for swapping, i>j and i
@random_queen same doubt 🥴
Thanks for the valuable content sir. Sir your algorithm is very simpler than geeks for geeks also. Always you make things easier to understand. Once again thank you sir 🙏🙏🙏
Thanks for your support towards our channel.
Sir
I need a example of taking middle element as a pivot
Thanks you sir...ur explanation is very clear...but I felt that,it is very complicated and confusing with lots of calculation steps
Sir ur veidoes are so helpful in exam time . Thanks for providing
I think you are my senior
I can understand clearly thank you so much sir 😊
Awesome lecture, Thank you sir 🙏
Thank you very much sir
Ur explanation is very easy to understand when compared to my lecturer's explanation
I will refered to my frnds also❤️🙏
Thanks sir, your videos help me a lot.
Sir at 22:43 (a[j]>pivot, this condition is going on), pivot is initially 10 but you took 20 as pivot and and did10>20 which is wrong.cause after decrementing j is at 0th index which is 10 and pivot is also 10 so it should be 10>10
Yeah exactly i am also stuck at this point... And in next recursion why should we take 'i' as 10 and pivot whereas 'j' as 20 why so?
Now 11 months have been passed away., Did you guys get your answers from anywhere?
You have an eagles eye, He made a mistake but the outcome is 'false' just as he stated, invariably, he's correct ... (10>10 ,10 is not greater than 10 so it is 'false'). Therefore, 10 is j and also the pivot, it can't be swapped. Recall, when i > j, j =0 and i = 1. swap( a[j],pivot) .
Thank u for explaining in so easy language
thank you so much sir for this valueable content.. it really helps me ..
Really nyc sir.. understood this video
sir i wached all ur videos and i like it and pls explain all code also sir
thank you sir.ur explanation is really good . sir please upload videos on hashing and it's functions in data structures
What step should follow ,at starting if there is no element greater than pivot? Where I should keep i position?
Swap
Thank you so much sir...
Sir I understand clearly ,but sir is there any chances to give the repeated elements in the question like 2,5,4,7,6,2 like this
22:41 isn't it 10 > 10 instead of 10 > 20 as the pivot is 10? also did not swap 10 and 20 when i is not less than j. little messed up.
Superb explanation sir👍
Anna NV super explained, keep it up and do more vedios on data structures
Sir I have a doubt. I have problem with my function to find pivot position.And my input={60,50,40,30,20,10} output comes like {0,20,30,40,50,60}. And the code is
int findpivot(int arr[],int low,int high)//FINDING PIVOT POSITION
{
int pivot=low;
int i=low+1,j=high,temp;
if(i
It is helpful sir thank you
22:42 in [j>pivot] j-- then here pivot is 10 so how [10>20], I have confused
sir make video program in quick sort...thanks for making this video...
thank u very much sir..can u write a programme for quick sort
Sir here last step we have to swap j and pivot element sir. Will u please explain it??
Thank you so much sir
nice explanation sir
Hi sir ur vedios r awesome easy to understand . Data structures and algorithms in c programming I want parsing arithmetic expression Plzzz do the vedio sir
Tq sir good lecture
Nice Sir Thanks..Also make videos on C++
Can u make complier design notes rply me
Can u upload complir design sub video
Upload complie deisgn sub
Give quick sort explanation for this example
15,5,100,28,13,6 from first partition
Good explanation
Sir, can i ask an example of real life scenario using quicksort
Sir in right side of pivot case
Around 20-21min
We have to take i=pivot+1=3
J=5
But u took I=0and j=2??????????
Sir in second step our j value is 40 sir but why u take pivot value at every step in j
sir when i=j , what should we do?
Like your vedios sir, but we want in less than 10 min
Sir kindly upload greedy algorithm as soon as possible
Tq sir 😍
supper sir thank you so much
sir at 28:30 how i value becomes 2 sir?is i=1 there
Bcoz a[i] =40 and pivot value is 50
Now, condition a[i]
Trace the quick sort algorithm to sort the list C, O, L, L, E, G, E in alphabetical order idi ans pettara sir please try chesanu nenu kani ravatledu
Sir please make a video for program of quick sort....
Sir is there any +infinity at the high side
Thank you sir ❤️❤️❤️❤️❤️
Thanks annaya
Thank you sir
Didnt understand j> piviot in ie 10>10 j but u ae mention 10>20
In second partition how taking the 50 as pivot....
Thank u sir 👍👍
Pls teach minimum spinning tree
sir pivot means
Sir u r making us confuse with pivot values...u r saying that..30 is pivot value . At the same time u r saying that.. starting value is pivot .. make it clear
Sir can u please make the Redblock tree insertion and deletion tutorial
Thank you sir ☺️
nice sir
Make vedios on c++ programming language
Explanation sir.............................Explanation Anthe .........................!!!!!
Can you make a tally learning vedios
Sir we want the program on quick sort
Did you write algorithm
Meru super sir
Thanks....sir
By hearing background voice I can say that you are TELUGU PERSON
Program? Sir
Please code it for c++
thanks sir.
little bit confusion
Sir explain with program
Simple program for quick sory and bubble sort please sir
Sir please explain quick sort program
Sir please write code also
Some confusion
Explain in clear
Sir I have a doubt I think at 22:50, there should be 10 greater than 10 .
10 is less than equal to 10 so condition pass n proceed for further increment of i
You are correct. it should not be 10>20, although he said it's false which is right, 10>10 will also be 'false' because 10 is not greater than 10. So it's also false.
@@sharwanajith6835 The condition requires only (> greater than), if not, then it's 'false'. 10 means 10 is not greater than 10 so it's false
The condition requires only (> greater than), if not, then it's 'false'. 10 is not greater than 10, it's false. no increment
Sir mari two elements same ayite
Why you don't make video in hindi to better explanation your English such a confusing more than question 🙋
Your English are perfect
😂😂😂first u correct ur english
not understant
54 26 93 17 77 31 44 55 20 please solve the problem sir i am confused on quick sort
Bro pls I need tis in java code format ...
public class QuickSort {
public static void main(String[] args) {
int ary[] = { 1, 30, 20, 10, 50, 60, 40 };
System.out.println(" Length Is ; " + ary.length);
print(ary);
sort(ary, 0, ary.length - 1);
print(ary);
}
private static void sort(int[] ary, int lowerBound, int upperBound) {
int position = partation(ary, lowerBound, upperBound);
partation(ary, lowerBound, position - 1);
partation(ary, position + 1, upperBound);
}
private static int partation(int[] ary, int lowerBound, int upperBound) {
int pivot = lowerBound;
int start = lowerBound;
int end = upperBound;
while (start < end) {
while (ary[start] ary[pivot]) {
end--;
}
if (start < end)
swap(ary, start, end);
else {
swap(ary, end, pivot);
}
}
return end;
}
private static void swap(int[] ary, int start, int end) {
int temp = ary[start];
ary[start] = ary[end];
ary[end] = temp;
}
private static void print(int[] ary) {
for (int i : ary) {
System.out.print(i+" ");
}
System.out.println("");
}
}
void quicksort(int low_index, int high_index)
{
int *p;
p = &a[low_index];
for(k=0;k
hi
i think you have missed the declaration part for function quicksort() so declare the function and your problem will be solved.
Thanks for your interest and support towards our channel.
@@sundeepsaradhi you mean I should declare the function globally?
Sir Telugu lo cheppandi sir
Im nt understanding complier dedign sub up load diz sub