insertion sort

cpp 代码

#include <stdio.h>

int
main(int argc, char *argv[])
{
    #define SIZE 6
    int A[] = {5, 2, 4, 6, 1, 3};
    int i, j, key;

    for (j = 1; j < SIZE; j++) {
        key = A[j];
        i = j - 1;

        while (i >= 0 && A[i] > key) {
            A[i+1] = A[i];
            i--;
        }

        A[i+1] = key;
    }

    for (j = 0; j < SIZE; j++)
        printf("%d\n", A[j]);
}

ruby 代码

A = [5, 2, 4, 6, 1, 3]

max_index = A.length - 1

1.upto(max_index) do |j|
    key = A[j]
    # Insert A[j] into the sorted
    # sequence A[1..j-1]
    i = j - 1
    while i >= 0 and A[i] > key do
        A[i+1] = A[i]
        i = i - 1
    end
    A[i+1] = key
end

0.upto(A.length - 1) {|i| puts A[i]}

python 代码

A = [5, 2, 4, 6, 1, 3]

max_index = len(A)

for j in range(1, max_index):
    key = A[j]
    i = j - 1

    while i >= 0 and A[i] > key:
        A[i+1] = A[i]
        i = i - 1

    A[i+1] = key

for i in range(0, len(A)):
    print A[i]