print 2nd largest number ??

SUNIL GUTTA

Hi hello everyone

Well i manged to use a build in function i.e array.sort(arrayname) to arrange it in ascending order well coming to my array list ex : {5,6,7,9,7,9,3,9}

In the above example there are multiple high & 2nd high numbers right .. if the list is unique its a no brainer :)

so how to get 2nd highest number from above example & any permament solution for such cases i.e wen we have duplicate values

TY

3 Replies

Know the answer? Post it — somebody with the same question will find it here.

Vulpes13y ago
Accepted answer
Well, this sort of problem is trivial using LINQ's Distinct() method but you can do it using traditional code as follows:

using System;

class Test
{
static void Main()
{
int[] arr = {5,6,7,9,7,9,3,9};
Array.Sort(arr);
int highest = arr[arr.Length - 1];
int secondHighest = highest;
for(int i = arr.Length - 1; i >= 0; i--)
{
if (arr[i] < highest)
{
secondHighest = arr[i];
break;
}
}
Console.WriteLine("Second highest is {0}", secondHighest);
Console.ReadKey();
}
}
Vulpes13y ago
This should work and could be generalized to find the n'th highest:

using System;

class Test
{
static void Main()
{
int[] arr = {5,6,6,7,9,7,9,3,9};
Array.Sort(arr);
int highest = arr[arr.Length - 1];
int nextHighest = highest;
int count = 1;

for(int i = arr.Length - 2; i >= 0; i--)
{
if (arr[i] < nextHighest)
{
nextHighest = arr[i];
count++;
if (count == 3) break;
}
}

Console.WriteLine("Third highest is {0}", nextHighest);
Console.ReadKey();
}
}
SUNIL GUTTA13y ago
Perfect just perfect ...!!

Well sorry to bother you again & again

well i have tried like an extension to above code i.e {5,6,6,7,9,7,9,3,9}

What if when we need to find 3rd highest number ??? The above mentioned code should be changed in which way

TY