Question

0/ 1 point Question 11 Consider the following sequence of characters being sorted with Quicksort. After using the median of the first, middle, and last values to choose pivot and then repositioning it, what is the resulting sequence? [R, U, K, M, W, F, B] [R, U, K, M, W, F, B] O [K, U, R, M, W, F, B] [M, U, K, R, W, F, B] [B, U, K, M, W, F, R]

Seeking in-depth explanation

Answer 1

okay, there can be multiple implementations of the quicksort. The answer that is marked wrong may actually be correct according to certain quicksort strategies.

so it totally depends upon, what is taught in the class

The most plausible explanation can be:

find the median of the 3 values:- first, last, and middle values. in this case, median = M

place the median at the first index using a swap

resulting sequence= [M,U,K,R,W,F,B]

//---

after this step, the usual quicksort (pivot = first element) can be used.

this is done to prevent the selection of a bad pivot

//---

drop a comment if you don't understand anything