-
Notifications
You must be signed in to change notification settings - Fork 1
/
second_largest_in_array.cpp
42 lines (40 loc) · 1021 Bytes
/
second_largest_in_array.cpp
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
#include <iostream>
#include <limits.h>
using namespace std;
void secondLargest(int a[], int n)
{
int i, first, second;
if(n < 2)
{
cout<<"No. of elements in the array are less than two";
return;
}
first = second = INT_MIN;
for(i=0; i<n; i++)
{
// If current element is smaller than the 'first', then update both 'first' and 'second'
if(a[i] > first)
{
second = first;
first = a[i];
}
// If a[i] is in between 'first' and 'second' then update 'second'
else if(a[i]>second && a[i]!=first)
second = a[i];
}
if (second == INT_MIN)
cout<<"There is no second largest element\n";
else
cout<<"The second largest element is "<<second;
}
int main()
{
int a[100], n;
cout<<"Enter total no. of elements in the array: ";
cin>>n;
cout<<"Enter the elements of the array: ";
for(int i=0; i<n; i++)
cin>>a[i];
secondLargest(a, n);
return 0;
}