数据结构之插入排序

数据结构之插入排序

Java代码

import java.util.Scanner;

public class InsertSort {
    public static void trace(int[] A, int N) {
        for (int i = 0; i < N; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(A[i]);
        }
        System.out.println();
    }

    public static void insertionSort(int[] A, int N) {
        int v, j;
        for (int i = 1; i < N; i++) {
            v = A[i];
            j = i - 1;
            while (j >= 0 && A[j] > v) {
                A[j + 1] = A[j];
                j--;
            }
            A[j + 1] = v;
            trace(A, N);
        }
    }

    public static void main(String[] args) {
        int N;
        int[] A = new int[100];
        Scanner scanner = new Scanner(System.in);
        N = scanner.nextInt();
        for (int i = 0; i < N; i++) {
            A[i] = scanner.nextInt();
        }
        trace(A, N);
        insertionSort(A, N);

    }
}