Question: A set S contains n (unsorted) numbers, where n> 3. The problem is to find the third largest number in the set. Give an algorithm

 A set S contains n (unsorted) numbers, where n> 3. The

A set S contains n (unsorted) numbers, where n> 3. The problem is to find the third largest number in the set. Give an algorithm of lowest O complexity to solve the problem. State your algorithm in no more than six simple English sentences such as sort the elements, add the numbers etc. (These two operations may not be ones you need in your algorithm.) Do not write a pseudocode. What is the O complexity of your algorithm

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!