求折半插入排序程序!!!急急急!!!!!!

template<typename T>
void insertion_sort( T * t, const int & size )
{
int key,
i, j,
low, high, mid;

for( i=1; i<size; i++ )
{
if( t[i] < t[i-1] )
{
low = 0;
high = i-1;
key = t[i];
while( low <= high )
{
mid = (low+high)/2;

if( key < t[mid] )
high = mid - 1;
else
low = mid + 1;
}
for( j=i; j>high+1; j-- )
t[j] = t[j-1];
t[high+1] = key;
}
}
}