有序表折半查找.docVIP

有序表折半查找:// 折半.cpp : Defines the entry point for the console application.//#include stdafx.h#includestdio.h#includestdlib.h#includemalloc.h#define LIST_INIT_SIZE 100#define EQ(a,b) ((a)==(b))#define LT(a,b) ((a)(b)) #define LQ(a,b) ((a)=(b))#define OVERFLOW -1#define OK 1typedef int keytype;typedef int Status;//typedef int Elemtype;typedef struct { keytype key;}Elemtype;typedef struct{ Elemtype *elem; int length; int listsize;}SqList;Status InitList_Sq(SqList L){ L.elem=(Elemtype*)malloc(LIST_INIT_SIZE*sizeof(Elemtype)); if(!L.elem) exit(OVERFLOW); L.length=0; L.listsize=LIST_INIT_SIZE; return OK;}int Search_Bin(SqList L,keytype key){ int low,high,mid; low=1; high=L.length;//置区间初值 while(low=high) { mid=(low+high)/2; if(EQ(key,L.elem[mid].key)) //找到待查元素 { printf(要查找元素的所在位置:%d\n,mid); return 1; } else if(LT(key,L.elem[mid].key)) high=mid-1;//继续在前半区间查找 else low=mid+1; //继续在后半区间查找 } return 0;}//折半查找int main(){ int key; SqList L; InitList_Sq(L); printf(请输入表长: ); scanf(%d,L.length); printf(请输入初始有序表: ); for(int i=0;iL.length;i++) { scanf(%d,L.elem[i].key); } printf(请输入待查元素: ); scanf(%d,key); Search_Bin(L,key); return OK;}