Question

Consider an array of integers consisting of the number: 12 100 32 19 92 89 90 45 105 55 95. Suppose the pivot is the middle element in the list . Apply one iteration of the partition algorithm of the quicksort to this list and show the list after each swap of the elements. Which index is returned by the partition ? No need to apply the complete quicksort, just show how the partition algorithm works. Follow the algorithm precisely and show your work.

Answer 1