#include <stdio.h>
 
int main(void) {
    int T[20] = {68, 29, 99, 2, 25, 16, 15, 24, 52, 21,
                 12, 91, 67, 5, 57, 4, 51, 17, 79, 71};
 
    int i, j, key;
 
    // 基本挿入法（Insertion Sort）
    for (i = 1; i < 20; i++) {
        key = T[i];
        j = i - 1;
 
        while (j >= 0 && T[j] > key) {
            T[j + 1] = T[j];
            j--;
        }
        T[j + 1] = key;
    }
 
    // ソート結果の表示
    for (i = 0; i < 20; i++) {
        printf("%d", T[i]);
        if (i != 19) {
            printf(", ");
        }
    }
    printf("\n");
 
    return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbih2b2lkKSB7CiAgICBpbnQgVFsyMF0gPSB7NjgsIDI5LCA5OSwgMiwgMjUsIDE2LCAxNSwgMjQsIDUyLCAyMSwKICAgICAgICAgICAgICAgICAxMiwgOTEsIDY3LCA1LCA1NywgNCwgNTEsIDE3LCA3OSwgNzF9OwoKICAgIGludCBpLCBqLCBrZXk7CgogICAgLy8g5Z+65pys5oy/5YWl5rOV77yISW5zZXJ0aW9uIFNvcnTvvIkKICAgIGZvciAoaSA9IDE7IGkgPCAyMDsgaSsrKSB7CiAgICAgICAga2V5ID0gVFtpXTsKICAgICAgICBqID0gaSAtIDE7CgogICAgICAgIHdoaWxlIChqID49IDAgJiYgVFtqXSA+IGtleSkgewogICAgICAgICAgICBUW2ogKyAxXSA9IFRbal07CiAgICAgICAgICAgIGotLTsKICAgICAgICB9CiAgICAgICAgVFtqICsgMV0gPSBrZXk7CiAgICB9CgogICAgLy8g44K944O844OI57WQ5p6c44Gu6KGo56S6CiAgICBmb3IgKGkgPSAwOyBpIDwgMjA7IGkrKykgewogICAgICAgIHByaW50ZigiJWQiLCBUW2ldKTsKICAgICAgICBpZiAoaSAhPSAxOSkgewogICAgICAgICAgICBwcmludGYoIiwgIik7CiAgICAgICAgfQogICAgfQogICAgcHJpbnRmKCJcbiIpOwoKICAgIHJldHVybiAwOwp9Cg==