SLIDE $03$:

SLIDE $03$:

$\backslash$table$[[$INDEX$,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],[$ELEMENT$,8,1,3,2,11,27,16,12,23,34,21,13,82,19,20,15,77,51,85,99,92]]$

Recall the quicksort sorting algorithm discussed in class. Consider that the function quicksort $(5,17)$ has been called on the array presented above.

What will be the left$-$to$-$right order of the $21$ elements of the array $($from index $0$ to $20)$ look like IMMEDIATELY BEFORE the function call has its two recursive children?

Q$3$: Consider the question posed in SLIDE $03$ above. To give your answer, type in only the numbers of each element and put a single space AFTER each number you type in $($including putting a space after the last number you type in$).$ Failure to adhere to this style of answer may result in an incorrect answer. $*$

Q$4$: Consider the question posed in SLIDE $03$ above. How many total element swaps occurred in the function call quicksort $(5,17)?$ Any time two pieces of data in the array exchange places a single element swap is said to have occurred.

$0$

$1$

$2$

$3$

$4$

$5$

$7$

$9$