Given the following declaration for a vector A: vector A{ 37, 23, 12, 1, 14, 13,...

 

Transcribed Image Text:

Given the following declaration for a vector A: vector A{ 37, 23, 12, 1, 14, 13, 4, 38, 49, 31 }; For each of the sorting algorithms identified below, i. show how the vector contents are updated after each iteration (be sure to clearly indicate the partitions, if applicable); ii. count the number of comparisons performed for each iteration; and iii. determine the actual number of comparisons performed by the algorithm. Here is the list of sorting algorithms (sort in ascending/increasing order): [10] 1. insertion sort [10] 2. selection sort [10] 3. bubble sort Given the following declaration for a vector A: vector A{ 37, 23, 12, 1, 14, 13, 4, 38, 49, 31 }; For each of the sorting algorithms identified below, i. show how the vector contents are updated after each iteration (be sure to clearly indicate the partitions, if applicable); ii. count the number of comparisons performed for each iteration; and iii. determine the actual number of comparisons performed by the algorithm. Here is the list of sorting algorithms (sort in ascending/increasing order): [10] 1. insertion sort [10] 2. selection sort [10] 3. bubble sort