插入排序(C/C++)

算法原理

算法复杂度

算法实现

#include <iostream>
#define LEN 10
using namespace std;
void print_array(int *data,int size)   //打印序列
{
for(int i = 0; i < size ;++i)
{
cout << data[i] << "  " ;
}
cout << endl;
}

void insert_sort(int data[])
{
for(int i = 1;i < LEN;++i)
{
int key = data[i]; //save key value in order to overwrite it
int j = i - 1;
while(j >= 0 && data[j] > key)
{
data[j+1] = data[j];  //move key value to correct position
j--;
}
data[j+1] = key; //set key value
//printarray(data,LEN);
}
}

int main()
{
int data[] = {2,1,5,8,6,4,3,10,5,9};
insert_sort(data);
print_array(data,LEN);
return 0;
}