Which of the following separates InsertionSort from Selec-tionSort and BubbleSort among
O(n2) sorting algorithms? (Select one answer from below)
a.) InsertionSort never does more swaps (shifts) than comparisons.
b.) By inserting into a sorted sublist InsertionSort potentially reduces the number of
comparisons needed.
c.) On each pass, InsertionSort always places one more entry in its final sorted spot.
d.) After each pass, InsertionSort leaves O(n) entries closer to their final sorted spots.
e.) By sorting in place, InsertionSort wastes no space.
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
How InsertionSort Differs from Selection and Bubble Sort
1. Which of the following separates InsertionSort from Selec-tionSort and BubbleSort among
O(n2) sorting algorithms? (Select one answer from below)
a.) InsertionSort never does more swaps (shifts) than comparisons.
b.) By inserting into a sorted sublist InsertionSort potentially reduces the number of
comparisons needed.
c.) On each pass, InsertionSort always places one more entry in its final sorted spot.
d.) After each pass, InsertionSort leaves O(n) entries closer to their final sorted spots.
e.) By sorting in place, InsertionSort wastes no space
