Question

^Hoare's Partition Sort ~Given the following numbers in array A ... 42 59 25 73 23 55 64 48 34 28 ... what is the contents of array A after the first pass of Hoare's version of the Partition method for the Quick Sort covered in class? a. 28 34 25 23 42 55 64 48 73 59 b. 55 25 42 28 23 48 73 34 64 59 c. 59 25 28 55 64 48 42 34 23 73 d. 23 55 34 42 59 48 64 73 28 25 e. 59 28 42 25 73 23 64 34 48 55

Answer 1

Hoare's partition sort, also known as quick sort follows Divide and conquery approach.
In each pass, it considers a pivot element in the array and moves it to its correct position.
After a pass, pivot element is moved in such a way that all the elements to the left of the pivot elements are lower than the element. All the elements to the right of the pivot are greater than the element.

So, Consider the first option a.

42 is moved to 5th position. We can see that all the elements ot the left are less than 42. All elements to the right are greater than 42. So, answer is
a.