-
Notifications
You must be signed in to change notification settings - Fork 0
/
day-20-sorting.java
38 lines (33 loc) · 970 Bytes
/
day-20-sorting.java
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
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int a[] = new int[n];
int numSwaps = 0;
int tmp;
for (int a_i = 0; a_i < n; a_i++) {
a[a_i] = in.nextInt();
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (a[j] > a[j + 1]) {
tmp = a[j];
a[j] = a[j+1];
a[j+1] = tmp;
numSwaps++;
}
}
if (numSwaps == 0) {
break;
}
}
System.out.println("Array is sorted in " + numSwaps + " swaps.");
System.out.println("First Element: " + a[0]);
System.out.println("Last Element: " + a[n-1]);
}
}