If n is the number of data elements then the best-case running time of Quick sort, bubble sort and Insertion sort respectively are:

1
log2n, n2, nlog2n
2
n, n, n × log2n
3
nlog2n, n, n
4
nlog2n, n2, n
5
n, n, n

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation