Question

8. Related to the merge sort is an efficient procedure called quick sort. Here we start with a list L : a,a2,, an, and use a as a pivot to develop two sublists L and L2 as follows. For i > 1, if aa, place a at the end of the first list being developed (which is L1 at the end the process); otherwise, place a at the end of L2. After all a,, i >1, have been processed, place a at the end of the first list. Now apply quick sort recursively to each of the lists Li and L2 to obtain sublists Lii, L12-L21, and L22- Continue the process until each of the resulting sublists contains one element. The sublists are then ordered, and their concatenation gives the ordering sought for the original list L. Apply quick sort to each list in Problem 7.

Answer 1

→ q,-3. 1s our pivot Nouo process all element a? '>i and seperate into ist L L2. し12→ None ae no one is a2 -→ Now Ln L22, L221- し222

222こ 3.10, g, 8 None →Now in L2222 10,9,8 22221 2 2221 3 L2222 15 Graphica oPocorts 34627|0 | g 58 3 3 ai 11 0 10

Concatenate the elument ol the. tree b Jat to' viqht trav8al 1, 2, 3, 4> 5, 6, 7, 8, 9, lo 15, 13. 12 24, 6, 8, 16, 13, 20, 14, IL 13 2o 14 24 15 19 1 3 14 I5 12 20 24 lq T9 2 12 14 1S Now Concotenate 1 , B,チ丿8. 12, 13, 14, îs, 16,13, 20, 24.