Algorithm 3 Quicksort Using Partition Considering Equal Elements
1:procedure Quicksort'(A,p,rA, p, rA,p,r)
2:if p<rp < rp<r then
3:(q,t)=(q, t) =(q,t)= Partition'(A,p,rA, p, rA,p,r)
4:Quicksort'(A,p,q−1A, p, q-1A,p,q−1)
5:Quicksort'(A,t+1,rA, t+1, rA,t+1,r)
6:end if
7:end procedure