Question

why is insertion sort considered as better algorithm than bubble sort?

Answer 1

Answer:

Specifically, Insertion is faster than Bubble because of what occurs in each pass: 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. Once a pass starts, Bubble Sort must see it through to the end.