Sorting Arrays with Insertion Sort

this program sort the values of 10 elements into ascending order
#include
using std::cout;
using std::cin;
using std::endl;
#include
using std::setw;


int main()
{
const int arraysize=10;
int array [arraysize];
int insert;
cout << "entre the array:\n"; // output original array for ( int i = 0; i <>> array[ i ];
cout << "Unsorted array:\n"; for ( int i = 0; i < next ="1;next0) && (array[move-1]>insert))
{
array [move]=array[move-1];
move--;
}
array[move]=insert;
}
cout << "\nSorted array:\n";

// output sorted array
for ( int i = 0; i < arraysize; i++ )
cout << setw( 4 ) << array[ i ];
system ("pause");
return 0;
}