查找算法 分块查找

/*
2020/4/6
分块查找
*/
#include<stdio.h>
#include<algorithm>
using namespace std;

struct Block
{
	int key;
	int start;
	int end;
}blocks[4];//分为4块


int find_max(int A[],int s,int e)
{
	int max = A[s];
	for(int i = s + 1;i<=e;i++)
	{
		if(A[i]>max)
			max = A[i];
	}
	return max;
}

int block_search(int A[],int x)
{
	int i,j;
	for(i = 0;i<4;i++)//寻找在哪一块，可以使用顺序查找，也就可以用折半查找
	{
		if(x<=blocks[i].key)
			break;
	}
	for(j = blocks[i].start;j<=blocks[i].end;j++)//在块中寻找，只能使用顺序查找
	{
		if(A[j] == x)
			break;
	}
	if(blocks[i].start<=j && j<=blocks[i].end)
		return j;
	else 
		return -1;
}

bool cmp(Block a,Block b)
{
	if(a.key < b.key)
		return true;
	else 
		return false;
}

int main()
{
	int i;
	int A[16]= {3,7,0,1,2,6,5,4,9,10,8,11,15,12,14,13};
	int ci = 0;
	for(i = 0;i<16;i+=4,ci++)
	{
		blocks[ci].key = find_max(A,i,i+3);
		blocks[ci].start = i;
		blocks[ci].end = i+3;
	}
	sort(blocks,blocks + 4,cmp);

	int index = block_search(A,4);
	if(index!= -1)
		printf("%d\n",index);
	else
		printf("-1\n");


	return 0;
}