#include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
void Insert(int *S, int k)
{
int key = S[k];
int j = k-1;
while(j>=0 && S[j] > key)
{
S[j+1] = S[j];
j--;
}
S[j+1] = key;
}
void Insertionsort(int S[], int n)
{
if(n>1)
Insertionsort(S,n-1);
Insert(S,n-1);
}
int main()
{
srand ( time(NULL) );
int S1_8[8];
for(int i=0; i<8; i++)
S1_8[i] = rand()%100;
Insertionsort(S1_8,8);
for(int i=0; i<8; i++)
{
cout << S1_8[i] << endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8c3RkbGliLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKIAogCnZvaWQgSW5zZXJ0KGludCAqUywgaW50IGspCnsKICAgICAgICBpbnQga2V5ID0gU1trXTsKICAgICAgICBpbnQgaiA9IGstMTsKICAgICAgICB3aGlsZShqPj0wICYmIFNbal0gPiBrZXkpCiAgICAgICAgewogICAgICAgICAgICAgICAgU1tqKzFdID0gU1tqXTsKICAgICAgICAgICAgICAgIGotLTsKICAgICAgICB9CiAKICAgICAgICBTW2orMV0gPSBrZXk7Cn0KIAogCnZvaWQgSW5zZXJ0aW9uc29ydChpbnQgU1tdLCBpbnQgbikKewogICAgICAgIGlmKG4+MSkKICAgICAgICAgICAgICAgIEluc2VydGlvbnNvcnQoUyxuLTEpOwogICAgICAgIEluc2VydChTLG4tMSk7CiAKfQogCmludCBtYWluKCkKewogICAgICAgIHNyYW5kICggdGltZShOVUxMKSApOwogICAgICAgIGludCBTMV84WzhdOwogICAgICAgIGZvcihpbnQgaT0wOyBpPDg7IGkrKykKICAgICAgICAgICAgICAgIFMxXzhbaV0gPSByYW5kKCklMTAwOwogCiAgICAgICAgSW5zZXJ0aW9uc29ydChTMV84LDgpOwogCiAgICAgICAgZm9yKGludCBpPTA7IGk8ODsgaSsrKQogICAgICAgIHsKICAgICAgICAgICAgICAgIGNvdXQgPDwgUzFfOFtpXSA8PCBlbmRsOwogICAgICAgIH0KIAogICAgICAgIHJldHVybiAwOwp9