Best case time complexities of Insertion sort, Mergesort, Bubble sort and Heapsort respectively are:

1
O(n), O(nlogn), O(n2), and O(n)
2
O(n), O(nlogn), O(n), and O(nlogn)
3
O(n2), O(n), O(n), and O(nlogn)
4
O(n), O(n), O(n2), and O(nlogn)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation