-
Notifications
You must be signed in to change notification settings - Fork 858
/
SortingBubbleSort.java
56 lines (52 loc) · 1.13 KB
/
SortingBubbleSort.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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/**
*
* Problem Statement-
* [Sorting: Bubble Sort](https://www.hackerrank.com/challenges/ctci-bubble-sort/problem)
*
*/
package com.javaaid.hackerrank.solutions.tutorials.ctci;
import java.util.Scanner;
/**
* @author Kanahaiya Gupta
*
*/
public class SortingBubbleSort {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
int swapCount = bubbleSort(a);
System.out.println("Array is sorted in " + swapCount + " swaps.");
System.out.println("First Element: " + a[0]);
System.out.println("Last Element: " + a[n - 1]);
}
/**
* @param a
* @return
*/
private static int bubbleSort(int[] a) {
int swapCount = 0;
int n = a.length;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
swapCount++;
swap(i, j, a);
}
}
}
return swapCount;
}
/**
* @param i
* @param j
*/
private static void swap(int i, int j, int[] a) {
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}