Question: what is the difference between merge sort and bubble sort?
Answer: Bubble sort is O(n2) and Merge Sort is O(nlogn) . ... Barring the maximum part, bubble sort is slower asymptotically, but it has a big advantage for small n in that it doesn't require the merging/creation of new arrays. In some implementations, this might make it faster in real time.