下面用到的结构定义
#define
EQ(a, b) ((a) == (b))
#define LT(a, b) ((a) < (b))
#define LQ(a, b) ((a) <= (b))
typedef int KeyType;
typedef struct ... {
KeyType key;
} ElemType;
typedef struct ... {
ElemType *elem;
int length;
} SSTable;
#define LT(a, b) ((a) < (b))
#define LQ(a, b) ((a) <= (b))
typedef int KeyType;
typedef struct ... {
KeyType key;
} ElemType;
typedef struct ... {
ElemType *elem;
int length;
} SSTable;
(1)顺序查找
//
sequential search
int search(SSTable st, KeyType key) ... {
st.elem[0].key = key;
int i;
for(i = st.length; !EQ(st.elem[i].key, key); i--)...{
}
return i;
}
int search(SSTable st, KeyType key) ... {
st.elem[0].key = key;
int i;
for(i = st.length; !EQ(st.elem[i].key, key); i--)...{
}
return i;
}
说明:ASL(average search length)为:(n + 1) / 2。
(2)二分查找
//
binary search
int binarySearch(SSTable st, KeyType key) ... {
int low = 1, high = st.length - 1;
int mid = (low + high) / 2;
while(low <= high)...{
if(EQ(st.elem[mid].key, key))...{
return mid;
}else...{
if(LT(st.elem[mid].key, key))...{
low = mid + 1;
}else...{
high = mid - 1;
}
}
}
return -1;
}
int binarySearch(SSTable st, KeyType key) ... {
int low = 1, high = st.length - 1;
int mid = (low + high) / 2;
while(low <= high)...{
if(EQ(st.elem[mid].key, key))...{
return mid;
}else...{
if(LT(st.elem[mid].key, key))...{
low = mid + 1;
}else...{
high = mid - 1;
}
}
}
return -1;
}
说明:ASL为log(n + 1) - 1。
(3)最优查找树
这样的一颗二分树,每个顶点的查找频率不同,且平均查找次数最小。构造时使用动态规划(dynamic programming),算法的复杂度为O(n * n * n),严《数据结构》中给出的次优查找树(nearly optimal search tree)代价为O(n * log(n))。
程序暂无。
(4)索引顺序表
查找时先查索引表(折半查找),然后在块中顺序查找。ASL最小为 O(n 1/2 + 1)。程序略。