用C语言实现折半插入排序算法

#include<stdio.h>
int main() {
	int r[8]= {0,49,38,65,97,76,23,17};
	int i,x,j,low,high,mid;
	for(i=2; i<=8; i++) {
		x=r[i];
		low=1;
		high=i-1;
		while(low<=high) {
			mid=(low+high)/2;
			if(x<r[mid])
				high=mid-1;
			else
				low=mid+1;
		}
		for(j=i-1; j>=low; --j) {
			r[j+1]=r[j];
		}
		r[low]=x;
	}
	for(i=2; i<=8; i++) {
		printf("%d\t",r[i]);
	}
	return 0;
}