package com.zerroi.leetcode.sort;

public class InsertionSort {
    public static void main(String[] args) {
        Insertion insertion = new Insertion();
        int[] ints = insertion.insertionSort(new int[]{2, 1, 9, 3, 10});
        for (int item : ints) {
            System.out.println("item = " + item);
        }

    }
}

class Insertion {
    public int[] insertionSort(int[] nums) {
        for (int i = 1; i < nums.length; i++) {
            int temp = nums[i];
            int j = i;
            while (j > 0 && temp < nums[j - 1]) {
                nums[j] = nums[j - 1];
                j--;
            }
            if (j != i) {
                nums[j] = temp;
            }
        }
        return nums;
    }
}