단순정렬 삽입(Insertion-sort)

package sunfa.sort;

import java.util.Arrays;
import java.util.Random;

public class InsertionSort {
	public static void main(String[] args) {
		Random ran = new Random();
		int[] a = new int[10];
		for (int i = 0; i < a.length; i++) {
			a[i] = ran.nextInt(100);
		}
		System.out.println(Arrays.toString(a));
		insertionSort(a);
		System.out.println(Arrays.toString(a));
		Arrays.sort(a);
		System.out.println(Arrays.toString(a));
	}

	/**
	 *       (insertion-sort)           
	 * @param a
	 */
	public static void insertionSort(int[] a) {
		for (int i = 1; i < a.length; i++) {
			int key = a[i];//          
			for (int k = 0; k < i; k++) {//0-i           
				if (a[i] < a[k]) {//                    ，              
					for (int j = i - 1; j >= k; j--) {
						a[j + 1] = a[j];//                   
					}
					a[k] = key;//         
					break;
				}
			}
		}
	}
}