Codeanu - 1 year ago 71

C Question

Is there a way in linear time by which we can find which is the second largest element of an array ?

Array elements can be positive, negative or zero.

Elements can be repetitive.

No STLs allowed.

Python can be used.

*Solution : Sort the array and take the second element but Sorting not allowed*

Modification : By definition second largest element will be the one which is numerically smaller. Like if we have

Arr = {5,5,4,3,1}

Then second largest is 4

Lets say if i want to generalize the question to kth largest and complexity less than linear like nlogn, what can be the solution.

Recommended for you: Get network issues from **WhatsUp Gold**. **Not end users.**

Answer Source

If you want a true O(n) algorithm, and want to find nth largest element in array then you should use quickselect (it's basically quicksort where you throw out the partition that you're not interested in), and the below is a great writeup, with the runtime analysis:

Recommended from our users: **Dynamic Network Monitoring from WhatsUp Gold from IPSwitch**. ** Free Download**