import java.io.*;
class Ascend {
int n,i,j,t;
String v;
int a[] = new int[10];
DataInputStream s = new DataInputStream(System.in);
@SuppressWarnings("deprecation")
void getdata(){
System.out.println("Enter the Number of Elements =");
try{
v = (s.readLine());
n = Integer.parseInt(v);
System.out.println("Enter the elements one by one ");
for(i=1; i<=n; i++){
a[i] = Integer.parseInt(s.readLine());
}
}catch(Exception e){
System.out.println("Excetion Raise = "+e);
}
}
void arrange(){
for(i=1; i<=n; i++){
for(j=1; j<n; j++){
if(a[i] > a[j]){
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
}
void putdata(){
System.out.println("The Sorted Elements are ");
for(i=1;i<=n;i++){
System.out.println(a[i]);
}
}
}
public class Ascending{
public static void main(String args[]){
Ascend a = new Ascend();
a.getdata();
a.arrange();
a.putdata();
}
}
class Ascend {
int n,i,j,t;
String v;
int a[] = new int[10];
DataInputStream s = new DataInputStream(System.in);
@SuppressWarnings("deprecation")
void getdata(){
System.out.println("Enter the Number of Elements =");
try{
v = (s.readLine());
n = Integer.parseInt(v);
System.out.println("Enter the elements one by one ");
for(i=1; i<=n; i++){
a[i] = Integer.parseInt(s.readLine());
}
}catch(Exception e){
System.out.println("Excetion Raise = "+e);
}
}
void arrange(){
for(i=1; i<=n; i++){
for(j=1; j<n; j++){
if(a[i] > a[j]){
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
}
void putdata(){
System.out.println("The Sorted Elements are ");
for(i=1;i<=n;i++){
System.out.println(a[i]);
}
}
}
public class Ascending{
public static void main(String args[]){
Ascend a = new Ascend();
a.getdata();
a.arrange();
a.putdata();
}
}
No comments:
Post a Comment