请大家帮我修改折半插入排序的代码，谢谢！
#include<iostream>
using namespace std;
void Binary_Insertion(int array[], int length)
{
for(int i=2; i<=5; i++)
{
int temp=array[i];
int low=1;
int high=i-1;
while(low<high)
{
int mid=(low+high)/2;
if(temp<array[mid])
{
high=mid-1;
}else
{
low=mid+1;
}
}
for(int j=i-1; j>=high+1; j--)
array[j+1]=array[j];
array[high+1]=temp;
}
}
int main()
{
int a[5];
cout<<"Please input five numbers."<<endl;
for(int i=0; i<5; i++)
cin>>a[i];
Binary_Insertion(a, 5);
for(int j=0; j<5; j++)
cout<<a[j]<<" ";
delete a;
return 0;
}
[解决办法]
http://blog.csdn.net/furney/article/details/7107145
