Quicksort
•The quicksort is also considered to be
a divide
and conquer sorting algorithm.
•The quicksort partitions a list of data
items that
are less than a pivot point and those that are greater than or equal to the pivot
point.
•You could think of this as recursive steps:
–step 1 - choose a pivot point in the
list of items
–step 2 - partition the elements around
the pivot