Could any one following questions 1.) Illustrate the performance of the selectio
ID: 3609514 • Letter: C
Question
Could any one following questions 1.) Illustrate the performance of the selection - sortalgorithm on the following input sequence & illustrate theperformance of the insertion - sort algorithm on the inputsequence (22, 15, 36, 44, 10, 3, 9, 13, 29, 25). Please mention each and every step. Thank you Could any one following questions 1.) Illustrate the performance of the selection - sortalgorithm on the following input sequence & illustrate theperformance of the insertion - sort algorithm on the inputsequence (22, 15, 36, 44, 10, 3, 9, 13, 29, 25). Please mention each and every step. Thank youExplanation / Answer
please rate - thanks I didn't realize that was even a question sort the numbers as you insert them numbers (22, 15, 36, 44, 10, 3, 9, 13, 29,25). get 22 list 22 input 15 - move the 22 and insert 15 beforeit list 15,22 input 36 list 15,22,36 input 44 list 15,22,36,44 input10 move entire list down 1 entry and insert 10 at the beginning list 10,15,22,36,44 input3 move entire list down 1 entry and insert 3 at the beginning list 3,10,15,22,36,44 input9 leave 3 where it is move everything else down 1 entry list 3,9,10,15,22,36,44input13 leave 3, 9 ,10 where they are move everything else down 1 entry
3,9,10,13,15,22,36,44
input29 leave 3,9,10,15,22 where they are - move 36 and 44 down one
3,9,10,13,15,22,29,36,44
input25 leave 3,9,10,13,15,22,where they are - move 29,36,44 down one
final array
3,9,10,13,15,22,25,29,36,44
list 3,10,15,22,36,44 input9 leave 3 where it is move everything else down 1 entry list 3,9,10,15,22,36,44
input13 leave 3, 9 ,10 where they are move everything else down 1 entry
3,9,10,13,15,22,36,44
input29 leave 3,9,10,15,22 where they are - move 36 and 44 down one
3,9,10,13,15,22,29,36,44
input25 leave 3,9,10,13,15,22,where they are - move 29,36,44 down one
final array
3,9,10,13,15,22,25,29,36,44