mmh

• Aug 6th, 2007

 

Efficiency of bubble sort = O(N^2)
Merge is a divide-and-conquer = O(N * log N)

Worst case: List is bigger than main memory. Bubble sort doesn't work.
Best case: List is very small, bubble sort may be faster, due to less overhead.