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

1
Insertion sort
2
Merge sort
3
Quick sort
4
Bubble sort

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation