Algorithms Asymptotic Worst Case Time and Time Complexity Introduction

Minimum time taken to find median of a list of numbers is

1
O(log n)
2
O(n)
3
O(n log n)
4
O (n2)

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