Find the second Largest number in single iteration
Program
int large=0,secod=0;int i,abc[]={25,60,80,99,9,8,100,5,55,56,59,110,99,111};
for (i=0; i<abc.length-1;i++)
{
if(abc[i] > abc[i+1])
{
if(large < abc[i])
{
large=abc[i];
}
else
{
secod=large;
}
}
else
{
if(large < abc[i+1])
{
large=abc[i+1];
}
else
{
secod=large;
}
}
}
System.out.println(" Large Number is " +large+"Second large=="+secod);
OutPut
Largr Number is 111Second large==110
