日常编程笔记 | 2022.10.3 | 二分法查找

C源码

//binary search algorithm and its testing program
#include<stdio.h>
#include<stdlib.h>

int BinarySearch(int*a, int low, int high, int tar);


int main()
{
	int n;//the size of the array
	int tar;//the number to be found
	int i;
	int index;//the index of the target number

	printf("Please input the size of the array : ");
	scanf("%d", &n);
	int* arr = (int*)malloc(sizeof(int)*n);
	
	printf("\n");
	
	printf("Please input the increasing array(with a space between two numbers) : ");
	for(i = 0; i < n; i++)
	{
		scanf("%d", arr + i);
	}
	
	printf("\n");
	
	printf("Please input the number to be found : ");
	scanf("%d", &tar);
	index = BinarySearch(arr, 0, n - 1, tar);
	
	printf("\n");
	
	if(index == -1 || index > n)
		printf("The number isn't found!\n");
	else
		printf("The index of the target number is : %d", index);
	
	return 0;
}

int BinarySearch(int*a, int low, int high, int tar)
{
	int mid = low + (high - low)/2;//find the medium
	
	if(a[mid] == tar)//found the number
	{
		return (mid + 1);		
	}
	
	else if(low > high)//didn't found
	{
		return -1;
	}
	
	else if(low <= high)//still in search
	{
		if(a[mid] < tar)//the target number is in the right part 
		{
			BinarySearch(a, mid + 1, high, tar);
		}
		
		else if(a[mid] > tar)//the target number is in the left part 
		{
			BinarySearch(a, low, mid, tar);
		}
	}	
}