[Java] 삽입 정렬 (Insertion Sort)

[9, 4, 1, 7, 3, 2, 1]  

[4, 9, 1, 7, 3, 2, 1]  (1회) 
[1, 4, 9, 7, 3, 2, 1]  (2회)
[1, 4, 7, 9, 3, 2, 1]  (3회)
[1, 3, 4, 7, 9, 2, 1]  (4회)
[1, 2, 3, 4, 7, 9, 1]  (5회)
[1, 1, 2, 3, 4, 7, 9]  (6회)

속도 : O(n^2)

import java.util.Arrays;
 
 
public class InsertionSort {
 
    public static void main(String[] args) {
 
        int[] arr = {9, 4, 1, 7, 3, 2, 1};
        int len = arr.length;
        int temp = 0;
        System.out.println(Arrays.toString(arr));
 
        for (int i = 1; i < len; i++) {
            for (int j = 0; j < i; j++) {
                if (arr[j] > arr[i]) {
                    temp = arr[j];
                    arr[j] = arr[i];
                    arr[i] = temp;
                }
            }
            System.out.println(Arrays.toString(arr));
        }
    }
 
}