Quick Sort presentation based on Algorithms. It includes programs, tags and diagrams with clear explaination. Hope it will be helpful. I have included various other steps to understand it. It is basically based or closely related to DDA.

5. Quicksort(A, p, r)
if p < r then
q := Partition(A, p, r);
Quicksort(A, p, q – 1);
Quicksort(A, q + 1, r)
5
A[p..r]
A[p..q –
1]
A[q+1..r
]
Partition
5
Partition(A, p, r)
x, i := A[r], p – 1;
for j := p to r – 1 do
if A[j]  x then
i := i + 1;
A[i]  A[j]
A[i + 1]  A[r];
return i + 1

8. p
numbers less
than p
numbers greater than or
equal to p
p