public static void insertSort(int[] arr) {
    if (arr == null || arr.length < 2) return;

    for (int i = 1; i < arr.length; i++) {
        int val = arr[i];
        int j = i - 1;
        while (j >= 0 && arr[j] > val) {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = val;
    }
}

public static void bubbleSort(int[] arr) {
    if (arr == null || arr.length < 2) return;

    for (int i = 0; i < arr.length; i++) {
        boolean isSwap = false;
        for (int j = 0; j < arr.length - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                swap(arr, j, j + 1);
                isSwap = true;
            }
        }
        if (!isSwap) return;
    }
}