bidividefind.c

集合了多种排序算法与数组操作功能。包括简单

//bidivideFind.c        二分查找请输入有序数组
/*二分查找值为t的元素,返回其下标*/
#include "text3.h"
int bidivideFind ( int * a , int low , int high, int t)
{
	int mid = (low + high)/2;
	
	if ( low < high )
	{
		if ( t = a[mid])
		{
			return mid;
		}
		else if ( t > a[mid] )
		{
			bidivideFind ( a , mid + 1 , high , t );
		}
		else 
			bidivideFind ( a , low , mid - 1 , t );
	}
	else
	{
		printf ( "there is no such number!\n");
		printf ( "exit\n " );
		return t;
	}
}