Insertion Sort

insertionSort.java

class Solution {
    public void insertionSort(int[] numbsers) {

        for(int i = 1; i < numbsers.length; i++) {

            int item = numbsers[i];
            int j = i - 1;

            while (j >= 0 && item < numbsers[j]) {
                numbsers[j + 1] = numbsers[j];
                j--;
            }

            numbsers[j + 1] = item;
        }
    }
}