Quick Sort #animation

#quicksort #shorts

[PPP-ompy]

presudocode:

Quicksort(A, p, r)

if(p<=r) {
q=Partition(A, p, r)
Quicksort(A, p, q-1)
Quicksort(A, q+1, r)

}

Partition(A, p, r) {
x=A[r]
i=p-1
for(j=1; j<r ; j++)
{
if (j<r){ i=i+1 SWAP[]A[i], A[j]}
}
SWAP(A[r], A[i+1])

return i+1

}

[friendsitcom]

Now seeing so many videos about the sort concept now i finally understand

[Ranqers]

Would this video demonstration represent iterative or recursive quicksort?

[QuickInterviewPrep]

How do we create a video animation something like this?

[Bk_official]

One question you choose 3 as a pivot? what if k at the beginning is less than 3 for example how to do it? For example 2 1 4 5 7 1 6 3 and you choosed 3 as a pivot? How to solve this?

[jeetkumbhar]

Bro can i ask you how did you create this animation vedio?