Insertion sort

import java.util.Arrays;

public class insertion {

    public static void insertionSort(int[] arr) {
        for (int i = 1; i < arr.length; i++) {
            int next = arr[i];
            int j = i;
            while (j > 0 && arr[j - 1] > next) {
                arr[j] = arr[j - 1];
                j--;
            }
            arr[j] = next;
        }
    }

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

    public static void main(String[] args) {
        int[] numbers = { 10, 45, 65, 11, 23, 7 };
        int n = numbers.length;
        insertionSort(numbers);
        print(numbers, n);
    }

}