-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathDay 20 - Sorting.java
36 lines (34 loc) · 1.01 KB
/
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
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 arr[] = new int[n];
for (int i = 0; i < n; i++)
{
arr[i] = in.nextInt();
}
int numSwaps = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (arr[j] > arr[j + 1]) {
int tmp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tmp;
numSwaps++;
}
}
if (numSwaps == 0) {
break;
}
}
System.out.println("Array is sorted in " + numSwaps + " swaps.");
System.out.println("First Element: " + arr[0]);
System.out.println("Last Element: " + arr[arr.length - 1]);
}
}