Question

Directions:

Problem 1: Write (using pen-and-paper rather than code) the list after each pass of quick and merge sort for the following list of numbers. Assume that you are sorting the numbers into ascending order. For quick sort, assume that the first number from the sublist is chosen as the pivot.

54 17 21 18 4 7 19 41

Problem 2: Write the list after each pass of the quick sort algorithm for the following list of numbers, using the following pivot selection strategies: first value of the sublist, middle (not median) value of the sublist, and the median of the first, middle, and last values. Assume you are sorting the numbers into ascending order.

For example, in the first pass of the algorithm on these numbers, the first pivot selection strategy chooses 54, the middle strategy chooses 18 (because 18 and 4 are in the middle of the list; when the list is of even length, we can just choose to go with the first of the two middle values), and the median of the first, last and middle values chooses 41 as the pivot value, because 41 is the median of 54, 18 and 41.

54 17 21 18 4 7 19 41

Repeat the above for this list of numbers. Remember that you are sorting into ascending order.

92 47 29 22 21 20 16 14

Answer 1

Quicksort is best and faster algo.

• It is inplace
• not stable
• practically used sorting technique.

に另oble«Ο β.ufck Sort っ. ldr alu compare-SV叶o 17,01 , 18 ,4,7,19,4 Smalle them sy 41 (仔31 18 4 구 19) (Sy Nous 919 19 ( co co co

is on ascending order-by quick so enge.. Sort ,3,1チ 18 , l9 , 21, 41 , sy 4, ㅋ, 19, 41 18, 91 구 ' S.4) (汗) (δί ) (18) (4 ) (T) (19) (41

9s 14 1604012089 uㅋ qs_ Nos, P.ss 2 C3 321316 and on

2 14 16 0 47 09 4-793

	best case	average case	worst case
Quick sort	nlogn	n^2	nlogn
merge sort	nlogn	nlogn	nlogn