『代码』··By/蜜汁炒酸奶

二分查找

/* 功能:二分查找 日期:2013-05-16 */ #include <stdio.h> #include <stdlib.h> #include <math.h> #define LEN 10 int main(void) { int a[LEN] = {1,3,5,7,9,11,13,17,19}; int low,high,mid,num; low = 0; high = LEN - 1; num = 10; while(low<=high) { mid = (low + high) / 2; if(num>a[mid]) { low = mid + 1; } else if (num<a[mid]) { high = mid-1; } else { break; } } if(low<=high) { printf(“存在为%d的值”,num); } else { printf(“不存在为%d的值”,num); } printf(“n”); system(“pause”); return 0; }

预览
Loading comments...
0 条评论

暂无数据

example
预览