Insertion sort better than Bubble sort?

Question

I am doing my revision for the exam.

Would like to know under what condition will Insertion sort performs better than bubble sort given same average case complexity

Answer 1

In the worst case both tend to perform at O(n^2)

In the best case scenario, i.e., when the array is already sorted, Bubble sort can perform at O(n).