插入排序

直接插入排序，时间复杂度为O(n^2)

#include <iostream>#include <stdio.h>using namespace std;int insertion_sort(int * unsorted,int len){    for(int i = 1 ; i<len ; i++){        int temp = unsorted[i];        int j =  i;        while( j > 0 && temp < unsorted[j-1]){            unsorted[j] = unsorted[j-1];            j--;        }        unsorted[j] = temp;    }    return 1;}int printarry(int* arry,int len){    for(int i=0 ; i<len ; i++ ){        printf("%d ",arry[i]);    }    printf("\n");    return 1;}int main(){    cout << "Hello world!" << endl;    int sortarry[] = {5,2,72,1,777,22222,22};    int len = sizeof(sortarry)/sizeof(int);    printf("unsorted arry len is %d ,value is: ",len);    printarry(sortarry,len);    insertion_sort(sortarry,len);    printf("sorted arry len is %d ,value is: " ,len);    printarry(sortarry,len);    return 0;}