-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathDay20.java
More file actions
47 lines (38 loc) · 1.56 KB
/
Day20.java
File metadata and controls
47 lines (38 loc) · 1.56 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
44
45
46
47
import java.io.*;
import java.util.*;
import java.util.stream.*;
import static java.util.stream.Collectors.toList;
public class Day20 {
static void swap(List<Integer> a, int x,int y){
int temp = a.get(x);
a.set(x, a.get(y));
a.set(y, temp);
}
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bufferedReader.readLine().trim());
List<Integer> a = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
// Write your code here
int numberOfSwaps = 0;
for (int i = 0; i < n; i++) {
// Track number of elements swapped during a single array traversal
for (int j = 0; j < n - 1; j++) {
// Swap adjacent elements if they are in decreasing order
if (a.get(j) > a.get(j+1)) {
swap(a, j, j+1);
numberOfSwaps++;
}
}
// If no elements were swapped during a traversal, array is sorted
if (numberOfSwaps == 0) {
break;
}
}
System.out.printf("Array is sorted in %d swaps.\n",numberOfSwaps);
System.out.printf("First Element: %d\n",a.get(0));
System.out.printf("Last Element: %d\n",a.get(a.size()-1));
bufferedReader.close();
}
}