package BubbleSort;

public class BubbleSort {
    public static void sort(int[] n) {
        int numbersToCheck = n.length;
        while (!sorted(n, numbersToCheck)) {
            for (int i = 0; i < n.length - 1; i++) {
                if (n[i] > n[i + 1])
                    interchange(i, i + 1, n);
            }
            numbersToCheck--;
        }
    }

    private static boolean sorted(int[] n, int numbersToCheck) {
        for (int i = 0; i < numbersToCheck - 1; i ++)
            if(n[i] > n[i + 1]) return false;
        return true;
    }

    private static void interchange(int i , int j, int[] n) {
        int temp = n[i];
        n[i] = n[j];
        n[j] = temp;
    }
}