Which of the following sorting algorithms does NOT have a worst-case running time of O(n2)?

• A. Insertion sort
• B. Merge sort
• C. Quicksort
• D. Bubble sort