ALDS1_1_A: Insertion Sort

题目

Insertion Sort
Write a program of the Insertion Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

for i = 1 to A.length-1
    key = A[i]
    /* insert A[i] into the sorted sequence A[0,...,j-1] */
    j = i - 1
    while j >= 0 and A[j] > key
        A[j+1] = A[j]
        j--
    A[j+1] = key
Note that, indices for array elements are based on 0-origin.

To illustrate the algorithms, your program should trace intermediate result for each step.

Input
The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by a single space.

Output
The output consists of N lines. Please output the intermediate sequence in a line for each step. Elements of the sequence should be separated by single space.

Constraints
1 ≤ N ≤ 100

Sample Input 1
6
5 2 4 6 1 3
Sample Output 1
5 2 4 6 1 3
2 5 4 6 1 3
2 4 5 6 1 3
2 4 5 6 1 3
1 2 4 5 6 3
1 2 3 4 5 6
Sample Input 2
3
1 2 3
Sample Output 2
1 2 3
1 2 3
1 2 3

代码块

#include <stdio.h>

void Trace(int n, int *a)
{//顺序输出数组元素
    for(int i=0; i<n; i++)
    {
        if(i!=n-1)
            printf("%d ", a[i]);
        else
            printf("%d\n", a[i]);
    }
}

void InsertSort(int n, int *a)
{
    int i, j, v;
    for(i=1; i<n; i++)
    {//从下标1开始，依次插入到下标0-i-1的元素中
        v = a[i];//用v保存待插入元素，防止被其他元素后移覆盖
        j = i-1;//采用从后向前比较的方式，这样如果元素大于v就可以直接将其往后移
        while(a[j]>v && j>=0)
        {
            a[j+1] = a[j];
            j--;
        }
        a[j+1] = v;
        Trace(n, a);
    }
}

int main(void)
{
    int i, n;
    scanf("%d", &n);
    int a[n];
    for(i=0; i<n; i++)
        scanf("%d", &a[i]);
    Trace(n, a);
    InsertSort(n, a);
    return 0;
}