# include & lt; stdio.h>, binarySearch ([], int int n, int 键){,int low =, 0;, int high =, n 作用;1;,而(=low<高){,int mid =,(时间+ low 高)/2,,int midVal =,(中期);,如果(midVal<键),low =, mid +, 1;, else 如果(midVal>键),high =, mid 作用;1;,else return ;中期,},return 1;,}, int 主要(){,int 我,val,,受潮湿腐烂;,int [8]={-32年,12日,16日,24日,36岁,45岁,59岁,98年},,,(i=0;, i<8;,我+ +),printf (" % d \ t”,,[我]);,printf (" \ n请输人所要查找的元素:”);,scanf (“% d”,和val);, ret =, binarySearch (8, val);,如果(1,==,随著,printf("查找掉败,\ n”);, else printf (“查找胜利,\ n”);, return 0;,}
-32,,,,12,,,,16,,,,24,,,,36,,,,45岁,,,,59岁,,,,98
请输出所要查找的元素:12
查找胜利
C言语二分查找(折半查找)算法及代码
