#include <math.h>
#include <stdio.h>
void insertionSort(int arr[], int n)
{
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
void printArray(int arr[], int n)
{
int i;
for (i = 0; i < n; i++)
}
int main()
{
int arr[] = { 12, 11, 13, 5, 6 };
int n = sizeof(arr) / sizeof(arr[0]);
insertionSort(arr, n);
printArray(arr, n);
return 0;
}
CiNpbmNsdWRlIDxtYXRoLmg+CiNpbmNsdWRlIDxzdGRpby5oPgogCnZvaWQgaW5zZXJ0aW9uU29ydChpbnQgYXJyW10sIGludCBuKQp7CiAgICBpbnQgaSwga2V5LCBqOwogICAgZm9yIChpID0gMTsgaSA8IG47IGkrKykgewogICAgICAgIGtleSA9IGFycltpXTsKICAgICAgICBqID0gaSAtIDE7CiAKICAgIAogICAgICAgIHdoaWxlIChqID49IDAgJiYgYXJyW2pdID4ga2V5KSB7CiAgICAgICAgICAgIGFycltqICsgMV0gPSBhcnJbal07CiAgICAgICAgICAgIGogPSBqIC0gMTsKICAgICAgICB9CiAgICAgICAgYXJyW2ogKyAxXSA9IGtleTsKICAgIH0KfQoKdm9pZCBwcmludEFycmF5KGludCBhcnJbXSwgaW50IG4pCnsKICAgIGludCBpOwogICAgZm9yIChpID0gMDsgaSA8IG47IGkrKykKICAgICAgICBwcmludGYoIiVkICIsIGFycltpXSk7CiAgICBwcmludGYoIlxuIik7Cn0KIAoKaW50IG1haW4oKQp7CiAgICBpbnQgYXJyW10gPSB7IDEyLCAxMSwgMTMsIDUsIDYgfTsKICAgIGludCBuID0gc2l6ZW9mKGFycikgLyBzaXplb2YoYXJyWzBdKTsKIAogICAgaW5zZXJ0aW9uU29ydChhcnIsIG4pOwogICAgcHJpbnRBcnJheShhcnIsIG4pOwogCiAgICByZXR1cm4gMDsKfQoKCiAgICA=