Question

Professor Fermat has the policy of giving A's to the top v/n students of his class, where n is to determine the top vVn students first sorts the list of students by their numerical grade, and then picks the top /n students from the sorted list This algorithm has time-complexity O(nlogn). Can you suggest a more efficient algorithm that has time-complexity O(n)? Describe your algorithm informally in English and justify its time-complexity. the number of students. The algorithm that he uses

Answer 1

oun bun nd 05 μου uthe Array A (ontain

lakie. ina way Random access pos - O L)

But i ane nd nu