-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSortingArray.java
More file actions
64 lines (48 loc) · 966 Bytes
/
SortingArray.java
File metadata and controls
64 lines (48 loc) · 966 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package Demo_1;
public class SortingArray {
public static void main(String a1[]){
int a[]={9,2,8,6,1,4};
int b[] ;
int temp=0;
int i=0, j=0;
for(i=0; i<a.length; i++){
for(j=0; j<a.length-1; j++){
if(a[j] > a[j+1]){
temp = a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
//System.out.println("element are : " +a[j]);
}
}
for(i=0;i<a.length-1;i++){
System.out.println("element are !!!!!!! : " +a[i]);
}
/*try{
b= new int[5];
for(i=0;i<a1.length-1;i++){
if(a1[i] <a1[i+1]){
temp = a1[i];
a1[i]=a1[i+1];
a1[i+1]=temp;
}
}
for(i=0;i<a1.length;i++){
System.out.println("b : " +a1[i]);
}
for(i=0;i<=a1.length;i++){
if(a1[i] >a1[i+1]){
temp = a1[i];
a1[i]=a1[i+1];
a1[i+1]=temp;
}
}
for(i=0;i<a1.length;i++){
System.out.println("b1 : " +a1[i]);
}
}catch(Exception e){
e.printStackTrace();
}
}*/
}
}