-
Notifications
You must be signed in to change notification settings - Fork 4.3k
/
BubbleSort.java
54 lines (48 loc) · 1.23 KB
/
BubbleSort.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
/**
* Bubble sort implementation
*
* <p>Run with:
*
* <p>$ ./gradlew run -Palgorithm=sorting.BubbleSort
*
* @author William Fiset, william.alexandre.fiset@gmail.com
*/
package com.williamfiset.algorithms.sorting;
public class BubbleSort implements InplaceSort {
@Override
public void sort(int[] values) {
BubbleSort.bubbleSort(values);
}
// Sort the array using bubble sort. The idea behind
// bubble sort is to look for adjacent indexes which
// are out of place and interchange their elements
// until the entire array is sorted.
private static void bubbleSort(int[] ar) {
if (ar == null) {
return;
}
boolean sorted;
do {
sorted = true;
for (int i = 1; i < ar.length; i++) {
if (ar[i] < ar[i - 1]) {
swap(ar, i - 1, i);
sorted = false;
}
}
} while (!sorted);
}
private static void swap(int[] ar, int i, int j) {
int tmp = ar[i];
ar[i] = ar[j];
ar[j] = tmp;
}
public static void main(String[] args) {
int[] array = {10, 4, 6, 8, 13, 2, 3};
BubbleSort sorter = new BubbleSort();
sorter.sort(array);
// Prints:
// [2, 3, 4, 6, 8, 10, 13]
System.out.println(java.util.Arrays.toString(array));
}
}