插入排序Insertion sort

#include <iostream>
using namespace std;
static void insert_sort(int unsorted[], int length)
{
  for(int i=1; i<length; i++)
  {   
    int key = unsorted[i];
    int j = i - 1;
    while(j >= 0 && unsorted[j] > key)
    {
      unsorted[j+1] = unsorted[j];
      j=j-1;
    }
    unsorted[j+1] = key;
  }  
}

int main(void)
{
  int x[6] = {5,2,4,6,1,3};
  insert_sort(x, 6);
  for(int i=0; i<6; i++)
  {
    cout << x[i] << " ";
  }
  cout << endl;
  getchar();
  return 0;
}