Teaching TN TRB CS Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Sorting

The worst case running times of Insertion sort, Merge sort and Quicksort, respectively, are:

1
O(n log n), O(n log n), and O(n2)
2
O(n2), O(n2), and O(n log n)
3
O(n2), O(n log n), and O(n log n)
4
O(n2), O (n log n), and O(n2)
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters