Algorithms Searching, Sorting and Hashing Sorting

Ordered pair that represents time complexity of divide phase and combine phase of merge sort algorithm respectively is:

1
O(1), O(n)
2
O(n), O(1)
3
O(log2 n), O(n log2 n)
4
O(n), O(n)
5
O(log2 n), O(log2 n)

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