3. (10 pts. Not from text) Consider this array of 8 elements: As explained in our text, we choose the pivot to be the first array element. Show how one Hoare partition is performed. Clearly show the indices i and j before each swap Hint: 4 swaps are performed. 3. (10 pts. Not from text) Consider this array of 8 elements: As explained in our text, we choose the pivot to be the first array element. Show how one Hoare partition is performed. pAi]iiifr+1 repeat repeat ii+ until Aip repeat jj1 until Ajp swap (A[i].Aj) until ij swap (A[i],Aj) Hundo last swap when ij swap (Ai],Aj) return j - Clearly show the indices i and j before each swap - Indicate with double arrows which elements get swapped - Redraw the array after each swap Hint: 4 swaps are performed..

1. 3. (10 pts. Not from text) Consider this array of 8 elements:
As explained in our text, we choose the pivot to be the first array element. Show how one Hoare
partition is performed.
Clearly show the indices i and j before each swap
Hint: 4 swaps are performed. 3. (10 pts. Not from text) Consider this array of 8 elements: As
explained in our text, we choose the pivot to be the first array element. Show how one Hoare
partition is performed. pAi]iiifr+1 repeat repeat ii+ until Aip repeat jj1 until Ajp swap (A[i].Aj)
until ij swap (A[i],Aj) Hundo last swap when ij swap (Ai],Aj) return j - Clearly show the indices
i and j before each swap - Indicate with double arrows which elements get swapped - Redraw the
array after each swap Hint: 4 swaps are performed.