What will be the worst-case time complexity of an efficient algorithm for putting exactly one specified element of an unsorted array on same index as in sorted array.

1
O(logn)
2
O(n)
3
O(n1/2)
4
O(nlogn)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation