Question

2. Consider your ID as an array of 9 elements, apply an insertion sort algorithm to sort the numbers in descending order. Show your steps. Example ID: 201710340 Array: 2 0 7 0 1 1 0 3 4

Answer 1

Given array is 9 © 7 3 410 print Insertion sont: In Insestion soit algorithm we tocat the adoay into two different parts Sorted list and unsoited List po 970 each time compax tool elements solt them coc \\الت and 1 7 10 3 4 0 Santed unsated 0 3 the Solted List O Now first කල insent nenden betroa Salted Position o after 220 So we keep on 2 because we need to solt in dg cending ode 2 34 o sorted narun sorted position insent in NOW sorted t we and o 17o Swapping 2 lolar 103 40 2 unsorted solled R71 No swapping of 2 and

о 3 4 07 position Insenting in its sorted of and לר Swapping 2 1 rololo 3.40 - Swapping of 7 and 2 71olio 340 772 and 2 - Swapping of o Tio340 . Solted list unsalted list Braco ints sorted position Inserting so - Swapping of 1 and O 72 l solo 3 40 NO swapping 72 11o Sated list unsalted list

in its soited Inserting position So cwill be aften O in the salted list 7 2 1 ol on salted o sarted list of 3 ando Insenting 3 in it's sorted position 3 and o 3o - Swapping of 30 - Swapping 7 2 1 1 3 0 olnuwe EIEN 371 Swapping of oz and 321 - Swapping of c3 and 7 2 3 lb oolouo 372 - Swapping of 3 and 2 10014 7 3 NO 3 47 Swapping occurs port, 209 bude poritastat oo 1 4 7 32 unsorted list Sorted list Insenting in it's sorted position

4 and ос 470 - Swapping 7 32 110401 0 ое 4 and O 430 Swapping 732 114oolo us swapping of 4 and 1 7 3 2 run ool 4 and 1 471 Swapping 7324!! oo ! O 472 - Swapping of 4 and 73 42 l oolo 7473 - Swapping of 4 and 3 74 3 2 Too sorted List unsated Insenting ink it's sated position 7 4 3 2 sorted list The is Final soited aoday 3 - O