1. Quicksort involves partitioning the original array and then _________. 2. After a partition in a simple version of quicksort, the pivot may be a. used to find the median of the array. b. exchanged...

1.
Quicksort involves partitioning the original array and then _________.

2.
After a partition in a simple version of quicksort, the pivot may be

a.
used to find the median of the array.

b.
exchanged with an element of the right subarray.

c.
used as the starting point of the next partition.

d.
discarded.