#include

int?BinaryChop（int?arr[]int?nLengthint?nNum）//二分查找
{
	if（arr?==?NULL?||?nLength?<=?0）return?-1;

	int?nMid;
	int?nLow;
	int?nHigh;

	nLow?=?0;
	nHigh?=?nLength-1;

	while（nLow?<=?nHigh）//低坐標小于高坐標執行遞歸直至找到要找的數字下標
	{
		nMid?=?nLow?+?（nHigh-nLow）/2;


		if（arr[nMid]?==?nNum）
		{
			return?nMid;
		}
		else?if（arr[nMid]?>?nNum）
		{
			//去左側
			nHigh?=?nMid-1;
		}
		else
		{
			//去右側
			nLow?=?nMid+1;
		}
	}

	return?-1;
}

int?main（）
{
	int?arr[]?=?{10122445568890100};
	int?n;
	n?=?BinaryChop（arrsizeof（arr）/sizeof（arr[0]）27）;
	printf（“%d\n“n）;
	return?0;
}

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件?????????654??2018-08-12?20:35??01_BinaryChop.c
?????文件?????????589??2018-05-25?20:06??03_InsertSort.c
?????文件????????1163??2018-06-07?17:05??03_KMP.c
?????文件????????1012??2018-05-29?16:53??04_CountSort.c
?????文件????????1083??2018-06-07?23:00??04_Sunday.c
?????文件????????1061??2018-05-28?20:38??05_QuickSort.c
?????文件????????1729??2018-06-14?17:08??05_TrieTree.c
?????文件????????1317??2018-05-30?19:12??07_MergeSort.c
?????文件????????1740??2018-06-03?00:04??08_HeapSort.c
?????文件????????2555??2018-06-05?18:37??09_BucketSort.c
?????文件????????1803??2018-06-05?20:39??10_RadixSort.c
?????文件????????1253??2018-06-05?19:37??bucket_sort.c
?????文件????????1116??2018-06-05?20:43??radix_sort.c