Which of the following sorting algorithm has the worst time complexity of n log(n)

(i) Insertion sort

(ii) Heap sort

(iii) Merge Sort

(iv) Quick Sort

1
ii and iv
2
i and iv
3
ii and iii
4
i and ii

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation