Question

Given image Sorting Algorithm handout – the column on the far left contains an input array of 24 strings to be sorted or shuffled; the column on the far right contains the strings in sorted order.

Each of the other numbered columns contains the contents at some intermediate step during one of the 6 sorting algorithms we have studied:

          Input SKIP SKIP 1      2      3      4      5      6      Sorted

t.1 g c n i o s a f f f f a o s t i s yed>< i l l a e e e e i o o i a r u elehdpwhpttt0dpshmhkkete' . elehdpwhptttodp sh yedxillaeeeei00iuir .1 g o f f a otis yx.1 1 a e e i i i i o e di e e o o a r u b e f f h h Ilmsssc e f 1 1 1 1 p p prt- is aff s oswktpthmedptheehlt diil.l e e e a r r i l o xi Imf s 1 h 1 h ptff se sb pc-r11 pe- ehdpwhpt七.os tcniosaf.ff s yxillaeeeiiriioruee befffhh111mpssstpc1r isif 00ad 11pe smeeletdphhk! r e d e o o a edphptkthwto gfaots nisafnrcoffsizii 4y.l I a e e i o x 1 e i i r i bffhh_ssef1Im pstcell-ppr - a 1 e yi,a e e e x e r i i r u, i i tttphdweep1h0dpshm.h ffasno ete- 2 cfaostis e111 m p.ppr s s st hppedel,n w t t t m e e h o s k d phkt! izisfs s'o hem wtehltkd phe- fsi eai: e yi o i i i x i r l e r u e e 1hfhbfssmlespfltpc1r1_pe_ 01234567890123456789012

0        left     hash   left     flow   byte   byte   lifo     byte   byte   byte

Match up the algorithm with the correct column; Use each answer only ONE time. The possible answers are: Selection Sort, Insertion Sort, Knuth Shuffle, Tops Down Merge Sort, Bottoms Up Merge Sort, No Shuffle Quick Sort