AlgoMaster Logo

Bubble Sort

arr=[64, 34, 25, 12, 22, 11, 90]
1public void bubbleSort(int[] arr) {
2    int n = arr.length;
3
4    for (int i = 0; i < n - 1; i++) {
5        boolean swapped = false;
6
7        for (int j = 0; j < n - 1 - i; j++) {
8            if (arr[j] > arr[j + 1]) {
9                // Swap elements
10                int temp = arr[j];
11                arr[j] = arr[j + 1];
12                arr[j + 1] = temp;
13                swapped = true;
14            }
15        }
16
17        // Early exit if no swaps
18        if (!swapped) {
19            break;
20        }
21    }
22}
0 / 69
640341252123224115906