学习算法手记【原】- 分块查找

==========================================================
author ：Vange
create-time: 2010-03-10
http://hi.baidu.com/romeroad/blog/item/8aa0efc4c6f473c038db496c.html
==========================================================
这个算法的关键是在原先有一个已经做好索引的索引表，这样就可以先在索引上进行二分查找，再到对应的索引的开始地址进行顺序查找。这个算法写挺久的。好麻烦，特别是边界的测试。看来思维还真的是一般般，这么一个小问题就搞了一个钟头。还是自己的调试方法有问题呢？
===========================================
#include <stdio.h> typedef struct { int value; int addr; } IDTable, *pTDTable; int BlockSearch(IDTable *arr, int nTable, int *pArr, int size, int val) { int low,high,mid; //对分块的二分查找 int left,right; low = 0; high = nTable -1; while (low <= high) { mid = (low + high)/2; if (val <= arr[mid].value) high = mid - 1; else low = mid + 1; } printf(" %d %d /n", low, high); //查找后得到的高低位，但一般是倒转过来的 if ( --low < nTable){ //后退1 low = low < 0 ? low + 1 : low; //从0开始 left = arr[low].addr; right = low + 1 == nTable ? size : arr[low+1].addr; // 判断右边的界限 //printf(" %d %d /n", left, right); while (left <right){ //在块里面顺序查找 if (pArr[left] == val) return left; left ++; } } return -1; } main() { int ints[] = {21,22,13,12, 33,43,30,29, 55,54,64,63,50,53}; int *pArr = ints; int size = sizeof(ints)/sizeof(*ints); //刚学习的计算数组大小，但暂时没有发现更有用的地方 IDTable tables[] = {​{21,0},{33,4},{55,8}}; pTDTable pTable = tables; printf(" the position of 11 is : %d /n", BlockSearch(pTable, 3, pArr, size, 11)); printf(" the position of 21 is : %d /n", BlockSearch(pTable, 3, pArr, size, 21)); printf(" the position of 43 is : %d /n", BlockSearch(pTable, 3, pArr, size, 43)); printf(" the position of 64 is : %d /n", BlockSearch(pTable, 3, pArr, size, 64)); }
===========================================