In this tutorial, we’ll find the second largest element in an array.
It is easy to find the largest number in a sequence. But if the second big number is required, there are a few difficulty.
Here is the finding second largest number without sorting algorithm.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 |
static void Main(string[] args) { int n, i, j = 0, largest, secondLargest; int[] arr1 = new int[50]; Console.Write("\n\nFind the second largest element in an array :\n"); Console.Write("-----------------------------------------\n"); Console.Write("Input the size of array : "); n = Convert.ToInt32(Console.ReadLine()); /* Stored values into the array*/ Console.Write("Input {0} elements in the array :\n", n); for (i = 0; i < n; i++) { Console.Write("element - {0} : ", i); arr1[i] = Convert.ToInt32(Console.ReadLine()); } /* find location of the largest element in the array */ largest = 0; for (i = 0; i < n; i++) { if (largest < arr1[i]) { largest = arr1[i]; j = i; } } /* ignore the largest element and find the 2nd largest element in the array */ secondLargest = 0; for (i = 0; i < n; i++) { if (i == j) { continue; /* ignoring the largest element */ } else { if (secondLargest < arr1[i]) { secondLargest = arr1[i]; } } } Console.Write("The Second largest element in the array is : {0} \n\n", secondLargest); Console.ReadKey(); } |
Output:
