#include<iostream> #include <stdio.h> #include <stack> using namespace std; void insert_sort(int *a, int begin, int end) { for(int i = 1; i < end; i++) { if (a[i]) < a[i-1] { int temp = a[i]; int j = i; while (j>0 && temp < a[j-1]) { a[j] = a[j-1]; j--; } a[j] = temp; } } } int main() { int a[8] = {4, 2, 6, 7, 9, 5, 1, 3}; int length = sizeof(a) / sizeof(a[0]); insert_sort(a, 0, length); for(int i=0; i < 8; i++) { cout << a[i] << " " << endl; } return 0; }