Post

Sorting Algorithms

Bubble sort

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
private void bubbleSort(int[] arr) {
    int len = arr.length;
    for (int i = 0; i < len - 1; i++>) {
        for (int j = 0; j < len - 1 - i; j++>) {
            if (arr[j] > arr[j + 1]) {
                swap(arr, j, j + 1);
            }
        }
    }
}

private void swap(int[] arr, int i, int j) {
    int tmp = arr[i];
    arr[i] = arr[j];
    arr[j] = tmp;
}
This post is licensed under CC BY 4.0 by the author.