[Arrays]D. Liang 6.14 Binary Search

Description

Implement the following function:

/* 
Elements in array are in decreasing order.
size is the size of array. 
If key found, return the index, else return -1 
*/
int binarySearch(int array[], int key, int size)

For example,

array[] = {9, 7, 5}

binarySerach(array, 9, 3)returns 0,
binarySerach(array, 0, 3)returns -1,

Problem Source: 程序设计I Chapter6 Arrays

Source.h

/* 
Elements in array are in decreasing order.
size is the size of array. 
If key found, return the index, else return -1 
*/
int binarySearch(int array[], int key, int size);

//   Date:2020/4/24
//   Author:xiezhg5
int binarySearch(int array[], int key, int size)
{
	//二分查找基本算法
	//采用了顺序查找 
	int i;
	for(i=0;i<size;i++)
	{
		if(array[i]==key)
		{
			return i;
			break;
		}
	}
	if(i==size)
		return -1;
}