Algorithm: Insert Sort

Algorithm analysis of inserting sort: (not finished)

http://blog.csdn.net/cjf_iceking/article/details/7916194

#include <iostream> #include <string> #include <stdio.h> #include <string.h> #include <    Algorithm>using namespace Std;void insertsort (int* pdataarray, int idatanum) {for (int i = 1; i < idatanum; i++)        Start with the 2nd data insert {int j = 0;        while (J < i && Pdataarray[j] <= pdataarray[i])//Find the insertion position J + +;            if (J < i)//i position before, there is a number larger than pdataarray[i], then move and insert {int k = i;            int temp = Pdataarray[i];                while (K > J)//reposition position {Pdataarray[k] = pdataarray[k-1];            k--;    } Pdataarray[k] = temp;    Insert}}}int Main () {int n;    int a[200];    int i;    cin>>n;    for (i=0; i<n; i++) {cin>>a[i];    } insertsort (A, n);          for (i=0; i<n; i++) {if (i==n-1) cout<<a[i]<<endl;    else cout<<a[i]<< ""; } return 0;}

Algorithm: Insert Sort