Question

Explain Quick Sort algorithm with exlmple.

Answer 1

in simple QUIKSORT ALGORITHM , we select an element as pivot,partition the array around pivot and recur for subarrays on left and right of pivot.

consider an array which has many redundant element. FOR EXAMPLE (1,4,2,4,2,4,1,2,4,1,2,2,2,2,4,1,4,4,4,)....c)arr(j...r) element greater then pivot.