数据结构：直接排序法 C++

#include<iostream>
#include<fstream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include <array>
#include <sstream>
using namespace std;


void insert_sort(int a[], int n)
{
int j, i, temp;
//精髓，抽牌的法
for (i = 0; i < n; i++)
{
temp = a[i];
for (j = i - 1; j >= 0 && temp < a[j]; j--)
{
a[j + 1] = a[j];
}


a[j + 1] = temp;
}
}


void print_arrary(int a[], int len)
{
int i;
for (i = 0; i < len; i++)
{
cout << a[i] << "";
}
cout << endl;
}


int main(int argc, int *argv[])
{
int a[] =  { 7,3,5,8,9,1,2,4,6 };
print_arrary(a, 9);
insert_sort(a,9);
print_arrary(a, 9);
getchar();
return 0;
}