Find Second Smallest and Second Largest Element from an Array in C++
Master C++ with Real-time Projects and Kickstart Your Career Start Now!!
Program 1
// find second largets element from array
#include<iostream>
#define clrscr() system("cls")
using namespace std;
int main()
{
int ar[500],n,i,max,p;
clrscr();
xyz:cout<<"\n Enter limit of array";
cin>>n;
if(n>500)
{
cout<<"\nInvalid Limit(1 to 500 only) Please enter gain";
goto xyz;
}
else
{
cout<<"\nEnter elements in array\n";
for(i=0;i<n;i++)
cin>>ar[i];
max=ar[0];
p=0;
for(i=1;i<n;i++)
{
if(ar[i]>max)
{
max=ar[i];
p=i;
}
}
cout<<"\n\n***Largets element is*** : "<<max;
cout<<"\n\n***Position is *** : "<<p;
//Second Largets
ar[p]=0;
max=ar[0];
p=0;
for(i=1;i<n;i++)
{
if(ar[i]>max)
{
max=ar[i];
p=i;
}
}
cout<<"\n\n----Second largets element is---- : "<<max;
cout<<"\n\n-----Position is ---- : "<<p;
}
}Program 2
// find second largets element from array
#include<iostream>
#define clrscr() system("cls")
using namespace std;
int main()
{
int ar[500],n,i,min,p;
clrscr();
xyz:cout<<"\n Enter limit of array";
cin>>n;
if(n>500)
{
cout<<"\nInvalid Limit(1 to 500 only) Please enter gain";
goto xyz;
}
else
{
cout<<"\nEnter elements in array\n";
for(i=0;i<n;i++)
cin>>ar[i];
min=ar[0];
p=0;
for(i=1;i<n;i++)
{
if(ar[i]<min)
{
min=ar[i];
p=i;
}
}
cout<<"\n\n***Smallest element is*** : "<<min;
cout<<"\n\n***Position is *** : "<<p;
//Second Smallest
ar[p]=232445490;
min=ar[0];
p=0;
for(i=1;i<n;i++)
{
if(ar[i]<min)
{
min=ar[i];
p=i;
}
}
cout<<"\n\n----Second Smallest element is---- : "<<min;
cout<<"\n\n-----Position is ---- : "<<p;
}
}
Did you know we work 24x7 to provide you best tutorials
Please encourage us - write a review on Google

