Question

Why is insertion sort considered better than bubble sort and does it have any significant impact on the total run time for N where n is the number of data points? (java)

Answer 1

Bubble sort algorithm sorts the elements by comparing the adjacent pairs at a time where the Insertion sort algorithm sorts the dataset by transferring one element at a time to the partially sorted array.

Insertion sort is faster when compared to Bubble sort because Bubble Sort swaps through all remaining unsorted values, moving one to the bottom. Insertion Sort swaps a value up into already-sorted values, stopping at the right place. Insertion sort is twice as fast as Bubble sort. Insertion sort has less number of swaps compared to bubble sort.

Yes. It has an impact on the run time. Because Insertion sort has a fast best-case running time and is a good sorting algorithm to use if the input list is already mostly sorted.

It is already sorted so the time required to complete these sort is lesser compared to bubble sort