Insertion Sort

package DataS;

public class InsertionSort {

    public static void main(String[] args) {
        int[] arr = {54, 33, 27, 12, 10, 11, 70};

        System.out.println("Array before sorting:");
        printArray(arr);

        insertionSort(arr);

        System.out.println("");
        
        System.out.println("Array after sorting:");
        printArray(arr);
    }

    static void insertionSort(int[] arr) {
        int n = arr.length;
        for (int i = 1; i < n; ++i) {
            int key = arr[i];
            int j = i - 1;

            while (j >= 0 && arr[j] > key) {
                arr[j + 1] = arr[j];
                j = j - 1;
            }
            arr[j + 1] = key;
        }
    }

    static void printArray(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }
}