-
Notifications
You must be signed in to change notification settings - Fork 100
Expand file tree
/
Copy pathExchangeSort.java
More file actions
40 lines (34 loc) · 1000 Bytes
/
Copy pathExchangeSort.java
File metadata and controls
40 lines (34 loc) · 1000 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
import java.util.Scanner;
class ExchangeSort {
public static void print(int[] arr) {
for(int elem: arr)
System.out.print(elem+ " ");
System.out.println("");
}
public static void exchangeSort(int[] arr) {
int n=arr.length;
for(int i=0; i<n-1; i++) {
for(int j=i+1; j<n; j++) {
if(arr[j] < arr[i]) { // sorting in non-decreasing order
// swap
int t=arr[i];
arr[i]=arr[j];
arr[j]=t;
}
}
}
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n]; // array created on the heap
for(int i=0; i<n; i++)
arr[i]=sc.nextInt();
sc.close();
// array input done
// sorting
exchangeSort(arr);
// printing the array
print(arr);
}
}