-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHRSorting.java
More file actions
51 lines (32 loc) · 1.19 KB
/
HRSorting.java
File metadata and controls
51 lines (32 loc) · 1.19 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
48
49
50
51
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class HRSorting {
public static void sortingArray(int[] arr){
int temp = 0;
int swap = 0;
for(int i = 0 ; i <= arr.length - 1 ; i++){
for(int j = 0 ; j < arr.length - 1; j++){
temp = arr[j + 1];
if(arr[j] > arr[j + 1]){
arr[j + 1] = arr[j];
arr[j] = temp;
swap = swap + 1;
}
}
}
System.out.println("No of swaps in sorting the array is :: "+ swap);
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
for(int a_i = 0; a_i < n; a_i++){
a[a_i] = in.nextInt();
}
// Write Your Code Here
sortingArray(a);
}
}