Challenge for Running Time and Big-O


What is the expected big-O time complexity of an optimal algorithm that finds the largest n/2 items in an unsorted array of size n (but does not sort them)?

Please sign in or sign up to submit answers.

Alternatively, you can try out Learneroo before signing up.

Contact Us
Sign in or email us at [email protected]