3. What is Quick Sort ??
Quick Sort is the most widely used of all the other sorting algorithms
because they are faster and consume less memory.
It is superior to (bubble sort) and (insertion sort) and (selection sort)
speed and distinct from (merge sort) speed and available memory.
4. What is Quick Sort ??
Division here is to divide the list into two smaller and larger
where there is a so-called (pivot) and it is determined smaller
or larger is not required to be a number of elements in both
sections of equal or arranged in ascending or descending
order.
This algorithm is the order of the array at a rate of ( n*log n), where n is
the step number of the elements of the array ..
5. What is Quick Sort ??
p
numbers less
than p
numbers greater than or
equal to p
p