Self Doubt

Question

Average number of comparisons of insertion sort is better than bubble sort by a constant factor ?

True or False?

Comments

both do $O(n^2)$ comparisons in worst case

---

but he is asking about the average number of comparisons?

---

The statement is True, as in bubble sort we will always do $\frac{n*(n-1)}{2}$ where n is the size of the array, but in insertion sort we sometimes do less number of comparisons, so average number of comparisons of insertion sort would be less.