Program Discussion :: Basics
97 / 279
Write program to find out second larges number in given number.
Answer:
#include
#include
using namespace std;
int main() {
int a[10], n;
int largest1, largest2, i;
coutn;
couta[i];
}
largest1 = a[0];
for (i = 0; i < n; i++) {
if (a[i] > largest1) {
largest1 = a[i];
}
}
largest2 = a[0];
for (i = 1; i < n; i++) {
if (a[i] > largest2 && a[i] < largest1)
largest2 = a[i];
}
cout
Asked In ::
Language:
Sneha Rai
7 Jul, 2017 9:30 AM
#include <stdio.h>
int main() {
int a[10], n;
int largest1, largest2, i;
printf("enter number of elements you want in array");
scanf("%d", &n);
printf("enter elements");
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
largest1 = a[0];
for (i = 0; i < n; i++) {
if (a[i] > largest1) {
largest1 = a[i];
}
}
largest2 = a[0];
for (i = 1; i < n; i++) {
if (a[i] > largest2 && a[i] < largest1)
largest2 = a[i];
}
printf("First and second largest number is %d and %d ", largest1, largest2);
}
Language:
Aarav
7 Jul, 2017 9:30 AM
#include <stdio.h>
#include<iostream>
using namespace std;
int main() {
int a[10], n;
int largest1, largest2, i;
cout<<"enter number of elements you want in array";
cin>>n;
cout<<"enter elements";
for (i = 0; i < n; i++) {
cin>>a[i];
}
largest1 = a[0];
for (i = 0; i < n; i++) {
if (a[i] > largest1) {
largest1 = a[i];
}
}
largest2 = a[0];
for (i = 1; i < n; i++) {
if (a[i] > largest2 && a[i] < largest1)
largest2 = a[i];
}
cout<<"First and second largest number is "<< largest1<<"and"<<largest2;
}
Language:
Siddhartha Paul
19 Jun, 2019 2:16 PM
import java.util.Scanner;
public class SecondLargestDigit
{
public static void main(String []args)
{
int d,temp;
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number: ");
int n=sc.nextInt();
String n1=Integer.toString(n);
int len=n1.length();
int n2=Integer.parseInt(n1);
int r[]=new int[len];
int i=0;
do
{
d=n%10;
r[i]=d;
n=n/10;
i++;
}while(n>0);
for(i=0;i<len-1;i++)
{
for(int j=0;j<len-i-1;j++)
{
if(r[j]>r[j+1])
{
temp=r[j];
r[j]=r[j+1];
r[j+1]=temp;
}
}
}
System.out.println("Second largest number: "+r[len-2]);
}
}