Insertion Sort in Java

InsertionSort.java

package com.feliperibeiro.kata;

public class InsertionSort {

    /**
     * In-place Insertion Sort - O(n^2)
     */
    public void sort(int[] items) {
        for (int i = 1; i < items.length; i++) {
            int n = items[i];
            int pos = i;
            while (pos > 0 && items[pos-1] > n) {
                items[pos] = items[--pos];
            }
            items[pos] = n;
        }
    }
}