Now 50 is pivot and 60 is I and 55 is false then first condition is false so we go to j then it is true we decrease then I and j have same value and again we check the I condition is false and we move to j and it is true we decrease then p and j are same value
j and pivot in same position. So 50>50 condition becomes false. Decrement j. We can't decrement. So swap pivot and j. But Both at same position so 60 and 55 is separated from 50. Then sort 60, 55.
❤ thank you mam 🎉
🎉
Mam one doubt the right array is not possible to arrange please clear the doubt
That is 50 60 55
50 is pivot. But 50 is already placed in its original position. So again it is divided in to left 50 and right 60, 55. Now you have to sort 60, 55.
Now 50 is pivot and 60 is I and 55 is false then first condition is false so we go to j then it is true we decrease then I and j have same value and again we check the I condition is false and we move to j and it is true we decrease then p and j are same value
j and pivot in same position. So 50>50 condition becomes false. Decrement j. We can't decrement. So swap pivot and j. But Both at same position so 60 and 55 is separated from 50. Then sort 60, 55.
Ok Mam thank you