直接插入排序

#include <iostream>
#include <vector>
#include <strstream>
#include <time.h>
int main()
{
    srand((unsigned)time(NULL));//为rand()函数生成不同的随机种子

    std::vector<double> numarray;

    for(int i=0;i<10;i++)
    numarray.push_back(rand()%10+1);

    for(std::vector<double>::iterator its=numarray.begin()+1;its!=numarray.end();its++)
    {
        std::vector<double>::iterator its_temp=its;
        std::vector<double>::iterator its1=its-1;
        //*its是选定的数 *its1是选定的数的上一位
        do{
            if(*its1<=*its)//停止向前
                break;
            if(*its1>*its)
            {
                std::swap(*its1,*its);
                its--;//向前
            }
            its1--;//比较的数也向前
        }while(its1!=numarray.begin()-1);
        its=its_temp;
        std::strstream ss;
        ss<<std::distance(numarray.begin(),its);
        std::string times;
        ss>>times;
        std::cout<<"NO."+times+":";
        for(int i=0;i<numarray.size();i++)
        std::cout<<numarray[i]<<" ";
        std::cout<<std::endl;
    }
for(int i=0;i<numarray.size();i++)
std::cout<<numarray[i]<<" ";
std::cout<<std::endl;
    return 0;
}