Chapter 7, Problem 65E

Program Plan Intro

Quick sort algorithm:

• This sort algorithm is used to sort a group of data quickly.
• It is easy to sort two small lists as compared to one large list.
• The stack is divided into many small lists or stacks.
• The array is divided based on the pivot value.
• The pivot value is chosen from a random index or middle value of the array.
• Recursion is used to sort the stack values.
• Combine technology merges the two lists after sorting.
• Data is already sorted; even then, it divides the lists into small ones and therefore it consumes execution time.
• Divide and conquer is the strategy used for Quick sort algorithm.
  • It splits big problems into smaller units.
  • After completing the process, it conquers the small units into one.