Enter a Array Size:
6
Enter a Array Value:
2
5
3
8
2
6
Descending order:
8
6
5
3
2
Second Largest Element:6
======================
package com.nataraja.b;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Iterator;
public class SecondLargest {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter a Array Size:");
int n=Integer.parseInt(br.readLine());
int a[]=new int[n];
int newArray[]=new int[n];
System.out.println("Enter a Array Value:");
for(int i=0;i<n;i++){
a[i]=Integer.parseInt(br.readLine());
}
HashSet hs=new HashSet();
for(int i=0;i<n;i++){
hs.add(a[i]);
}
newArray=new int[hs.size()];
Iterator it=hs.iterator();
int k=0;
while(it.hasNext()){
newArray[k++]=(int) it.next();
}
for(int i=0;i<hs.size();i++){
for(int j=i+1;j<hs.size();j++)
if(newArray[i]<newArray[j]){
int t=newArray[i];
newArray[i]=newArray[j];
newArray[j]=t;
}
}
System.out.println("Descending order:");
for(int i=0;i<newArray.length;i++){
System.out.println(newArray[i]);
}
System.out.println("Second Largest Element:"+newArray[1]);
}
}
6
Enter a Array Value:
2
5
3
8
2
6
Descending order:
8
6
5
3
2
Second Largest Element:6
======================
package com.nataraja.b;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Iterator;
public class SecondLargest {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter a Array Size:");
int n=Integer.parseInt(br.readLine());
int a[]=new int[n];
int newArray[]=new int[n];
System.out.println("Enter a Array Value:");
for(int i=0;i<n;i++){
a[i]=Integer.parseInt(br.readLine());
}
HashSet hs=new HashSet();
for(int i=0;i<n;i++){
hs.add(a[i]);
}
newArray=new int[hs.size()];
Iterator it=hs.iterator();
int k=0;
while(it.hasNext()){
newArray[k++]=(int) it.next();
}
for(int i=0;i<hs.size();i++){
for(int j=i+1;j<hs.size();j++)
if(newArray[i]<newArray[j]){
int t=newArray[i];
newArray[i]=newArray[j];
newArray[j]=t;
}
}
System.out.println("Descending order:");
for(int i=0;i<newArray.length;i++){
System.out.println(newArray[i]);
}
System.out.println("Second Largest Element:"+newArray[1]);
}
}
No comments:
Post a Comment