-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsortArray.java
More file actions
43 lines (34 loc) · 1.07 KB
/
sortArray.java
File metadata and controls
43 lines (34 loc) · 1.07 KB
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
import java.util.Arrays;
public class sortArray {
public static void main(String[] args) {
int[] arr={-10,-2,3,55,71,1,0};
System.out.println(Arrays.toString(arr));
Asort(arr);
System.out.println(" after ascending"+Arrays.toString(arr));
Dsort(arr);
// System.out.println();
System.out.println(" after descending "+Arrays.toString(arr));
}
static void Asort(int[] arr){
for(int i=0;i<arr.length;i++){
for(int j=i+1;j<arr.length;j++){
if(arr[i]>arr[j]){
int temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}//System.out.print(arr[i]+ " ");
}
}
static void Dsort(int[] arr){
for(int k=0;k<arr.length;k++){
for(int l=k+1;l<arr.length;l++){
if(arr[l]>arr[k]){
int t=arr[l];
arr[l]=arr[k];
arr[k]=t;
}
}
}
}
}