binarysearch.cpp

小程序,VC++处学者用的,关于二分法查找的 经典的BINARYSEARCH算法..不错哦

//************      BinarySearch.cpp      *************


#include "BinarySearch.h"

Binarysearch::Binarysearch( int *xbptr,int xsearchKey,int xlow,int xhigh,int xsize )
:bptr(xbptr),a(xsearchKey),low(xlow),high(xhigh),size(xsize)
{
	bptr = new int [xsize];
	for ( int i = 0; i < xsize; i++ )
		bptr[i] = xbptr[i];
}


int Binarysearch::bSearch ( int a, int b[ ] )
{
	int middle;
	
	while ( low <= high )
	{
		middle = (low + high) / 2 ;
		if ( a == b[middle] )
			return middle;
		else
			if( a < b[middle] )
				high = middle - 1;
			else
				low = middle + 1;
	}
	return -1;
}




void Binarysearch::sort( int xa[], int xsize )
{
	int i,temp;

	for ( int pass = 1; pass < xsize; pass ++ )
	{
		for ( i = 0; i < xsize - pass; i++ )
			if ( xa[i] > xa[i+1] )
			{
				temp = xa[i];
				xa[i] = xa[i+1];
				xa[i+1] = temp;
			}
	}
	
	for ( i = 0; i < xsize; i++ )
				cout << xa[i] << ",";
			cout << endl;
}


Binarysearch::~Binarysearch()
{
	delete[] bptr;
}