Run each of the three sorting algorithms on this data. For each, show which entries in the array get swapped.

42, 64, 128, 15, 2, 6, 123, 14, 16

Bubble:

Selection:

Insertion:

Fill in the following table with the theoretical run-times Best Case Average Case Worst Case Bubble Sont Selection Sort Insertion Sort Each of the sorting algorithms is made up of two nested loops. For each loop, state whether it is count-controlled or sentinel controlled Outer Loorp Algorithm Bubble Sort Selection Sort insertion sort Inner Loop Why do we hate duplication of code? Fill in the following table with the theoretical run-times Best Case Average Case Worst Case Bubble Sont Selection Sort Insertion Sort Each of the sorting algorithms is made up of two nested loops. For each loop, state whether it is count-controlled or sentinel controlled Outer Loorp Algorithm Bubble Sort Selection Sort insertion sort Inner Loop Why do we hate duplication of code