第三周作业——顺序查找和二分查找

#include <iostream>
#include "stdafx.h"
#include <fstream>

using namespace std;
#define PARENT_AMOUNT 10000000		//已知为1000000个数据
#define  CHILD_AMOUNT 16					//待查找数据为16个

int getDataFromFile(const char *filename,int *data)			//将txt文档的数字存入data数组
{
	ifstream LargeData;
	int index = 0;
	LargeData.open(filename, ios::in);
	if (!LargeData)
	{
		cerr << "the fucking file openning failed!" << endl;
		exit(1);
	}

	while(!LargeData.eof())						
	{
		LargeData >> data[index++];
	}
	LargeData.close();
	return index;
}

int BSearch(int *array, int low, int high, int target ) //二分查找法，参考数据结构
{  

	while(low <= high)  
	{  
		int mid=(low + high) / 2;  
		if(target == array[mid])  
			return mid;  
		else if(target < array[mid])  
			high = mid-1;  
		else  
			low = mid+1;  
	}  
	return -1;  
}  

int main()
{
	int * child = new int[CHILD_AMOUNT];
	int * parent = new int[PARENT_AMOUNT];
	int child_index,parent_index;
	parent_index = getDataFromFile("largeW_bubble.txt", parent);
	child_index = getDataFromFile("tinyW.txt", child);

	cout << "the mismatching numbers are: " << endl;
	for(int i=0;i < CHILD_AMOUNT; i ++)  
	{  
		if( BSearch(parent, 0, parent_index - 1, child[i]) == -1 )  
			cout << child[i] << endl;  
	}  

	delete []parent;
	delete []child;
	return 0;
}