插入排序法排序数组

#include <iostream>
using std::cout;
using std::endl;
#include <iomanip>
using std::setw;l
int main()
{const int arraySize=10;
 int data[arraySize]={34,56,4,10,77,51,93,30,5,52};
 int insert;
 for(int i=0;i<arraySize;i++)
  {insert=data[i];
   int move=i;
   while((move>0)&&(data[move-1]>insert))
    {data[move]=data[move-1];
     move--;
     }
   data[move]=insert;
   }
 for(int i=0;i<arraySize;i++)
   cout<<setw(4)<<data[i];
 cout<<endl;
 return 0;
}