查找算法

//静态查找——折半查找 #include "stdio.h" #define SIZE 11 int Bsearch(int num[SIZE],int number,int low,int high) { int mid; while(low<=high) { mid=(low+high)/2; if(number==num[mid]) return mid; else if(number>num[mid]) low=mid+1; else high=mid-1; } return 0; } main() { int num[SIZE],number,index,i; for(i=1;i<SIZE;i++) num[i]=i;//前提是已排序 printf("please input a number:"); scanf("%d",&number); index=Bsearch(num,number,1,SIZE-1); if(index==0) printf("not find!"); else printf("/nlocation:%d",index); getch(); } ***************************************************************************** //静态查找——次优查找树 #include "stdio.h" #include "stdlib.h" #include "math.h" #include "conio.h" #define SIZE 11 struct Node { int num; int weight; struct Node *lchild,*rchild; }; typedef struct { int num[SIZE]; int weight[SIZE]; }NUM; Pratition(NUM *array,int low,int high) { array->num[0]=array->num[low]; array->weight[0]=array->weight[low]; while(low<high) { while(low<high&&array->num[high]>array->num[0]) --high; { array->num[low]=array->num[high]; array->weight[low]=array->weight[high]; } while(low<high&&array->num[low]<=array->num[0]) ++low; { array->num[high]=array->num[low]; array->weight[high]=array->weight[low]; } } array->num[low]=array->num[0]; array->weight[low]=array->weight[0]; return low; } Sort(NUM *array,int low,int high) { int mid; if(low<high) { mid=Pratition(array,low,high); Sort(array,low,mid-1); Sort(array,mid+1,high); } } CreateSW(int sw[SIZE],int weight[SIZE]) { int i,j; for(i=0;i<SIZE;i++) { sw[i]=0; for(j=1;j<=i;j++) sw[i]+=weight[j]; } } CreateTree(struct Node *p,int sw[SIZE],NUM array,int low,int high) { int i=low,j,min=abs(sw[high]-sw[low]),dw=sw[high]-sw[low-1]; for(j=low+1;j<=high;j++) if(abs(dw-sw[j]-sw[j-1])<min) { i=j; min=abs(dw-sw[j]-sw[j-1]); } p=(struct Node *)malloc(sizeof(struct Node)); p->num=array.num[i]; p->weight=array.weight[i]; if(i==low) p->lchild=NULL; else CreateTree(p->lchild,sw,array,low,i-1); if(i==high) p->rchild=NULL; else CreateTree(p->rchild,sw,array,i+1,high); return p; } main() { NUM array; struct Node *p,*head; int i,sw[SIZE],number; randomize(); for(i=1;i<SIZE;i++) { array.num[i]=rand()%100; array.weight[i]=rand()%10; } Sort(&array,1,SIZE-1); array.num[0]=0; array.weight[0]=0; CreateSW(sw,array.weight); head=CreateTree(p,sw,array,1,SIZE-1); for(i=0;i<SIZE;i++) printf("%d %d/n",array.num[i],array.weight[i]); for(i=0;i<SIZE;i++) printf("%d ",sw[i]); getch(); } ***************************************************************************** //动态查找——二叉排序树 #include "stdio.h" #include "conio.h" struct BitTree { int data; struct BitTree *lchild,*rchild; }; struct BitTree *Insert(struct BitTree *root,int key) { struct BitTree *p,*pr,*s; p=root; pr=p; s=new struct BitTree; s->data=key; s->lchild=s->rchild=NULL; while(p) { printf("p->data:%d",p->data); if(p->data==key) {printf("find!");getch();return root;} else if(key>p->data) {printf("search right/n");getch();pr=p;p=p->rchild;} else {printf("search left/n");getch();pr=p;p=p->lchild;} } printf("have not this node!"); getch(); if(!pr) {root=s;printf("create tree!/n");getch();return root;} else { if(key>pr->data) {printf("input right/n");pr->rchild=s;getch();} else {printf("input left/n");pr->lchild=s;getch();} return root; } } int Search(struct BitTree *&p,struct BitTree *&pr,int key) { while(p) { if(p->data==key) return 1; else if(key>p->data) {pr=p;p=p->rchild;} else {pr=p;p=p->lchild;} } printf("have not this node!"); } void Delete(struct BitTree *&p,struct BitTree *&pr) { struct BitTree *pt; getch(); if(!p->lchild&&!p->rchild) pt=NULL; else if(p->lchild&&!p->rchild) {pt=p->lchild;} else if(!p->lchild&&p->rchild) {pt=p->rchild;} else { pt=p->lchild; pr=p; while(pt->rchild) {pr=pt;pt=pt->rchild;} p->data=pt->data; if(pr==p) pr->lchild=pt->rchild; else pr->rchild=pt->rchild; } if(pr->lchild==p) pr->lchild=pt; else if(pr->rchild==p) pr->rchild=pt; } void Print(struct BitTree *p) { if(p) { Print(p->lchild); printf("%d/n",p->data); Print(p->rchild); } } main() { int quit=0,key; struct BitTree *root,*pr,*p; root=NULL; while (!quit) { char ch; puts("1 Insert"); puts("2 Delete"); puts("3 Print"); puts("4 Exit"); ch=getch(); switch(ch) { case '1': printf("Please input:"); scanf("%d",&key); root=Insert(root,key); break; case '2': printf("Please input:"); scanf("%d",&key); p=root; pr=NULL; Search(p,pr,key); Delete(p,pr); break; case '3': p=root; Print(p); getch(); break; case '4':quit=1;break; } } } ***************************************************************************** //动态查找——平衡二叉树 #include "stdio.h" #include "conio.h" #define EH 0; #define LH 1; #define RH -1; #define TRUE 1; #define FALSE 0; typedef struct BSTNode { int data; int bf; struct BSTNode *lchild,*rchild; }*BitTree; void R_Rotate(BitTree &p) { BitTree lc; lc=p->lchild; p->lchild=lc->rchild; lc->rchild=p; p=lc; } void L_Rotate(BitTree &p) { BitTree rc; rc=p->rchild; p->rchild=rc->lchild; rc->lchild=p; p=rc; } int LeftBalance(BitTree &p) { BitTree lc,rd; lc=p->lchild; switch(lc->bf) { case 1: lc->bf=p->bf=EH; R_Rotate(p); break; case -1: rd=lc->rchild; switch(rd->bf) { case 1: p->bf=RH;lc->bf=EH;break; case 0: p->bf=lc->bf=EH;break; case -1: p->bf=EH;lc->bf=LH;break; } rd->bf=EH; L_Rotate(p->lchild); R_Rotate(p); break; } } int RightBalance(BitTree &p) { BitTree rc,ld; rc=p->rchild; switch(rc->bf) { case -1: rc->bf=p->bf=EH; L_Rotate(p); break; case 1: ld=rc->lchild; switch(ld->bf) { case 1: p->bf=LH;rc->bf=EH;break; case 0: p->bf=rc->bf=EH;break; case -1: p->bf=EH;rc->bf=RH;break; } R_Rotate(p->rchild); L_Rotate(p); break; } } int Insert(BitTree &p,int key,int &taller) { if(!p) { p=new BSTNode; p->lchild=p->rchild=NULL; p->data=key; p->bf=EH; taller=TRUE; } else { if(key==p->data) {taller=TRUE;return 0;} if(key<p->data) { if(!Insert(p->lchild,key,taller)) return 0; if(taller) switch(p->bf) { case 1: LeftBalance(p);taller=FALSE;break; case 0: p->bf=LH;taller=TRUE;break; case -1: p->bf=EH;taller=FALSE;break; } } else { if(!Insert(p->rchild,key,taller)) return 0; if(taller) switch(p->bf) { case 1: p->bf=EH;taller=FALSE;break; case 0: p->bf=RH;taller=TRUE;break; case -1: RightBalance(p);taller=FALSE;break; } } } } void Print(BitTree &p) { if(p) { printf("%d %d/n",p->data,p->bf); Print(p->lchild); Print(p->rchild); } } main() { BitTree root,p; int quit=0,key,taller; char ch; root=NULL; while(!quit) { puts("1 Insert"); puts("2 Print"); puts("3 Exit"); ch=getch(); switch(ch) { case '1': p=root; printf("Please Input:"); scanf("%d",&key); Insert(p,key,taller); root=p; break; case '2':p=root;Print(p);getch();break; case '3':quit=1;break; } } } ***************************************************************************** //动态查找——B+和B-树，在文件系统中很好用***************************************************************************** //哈希表查找（简单的算法描述） #define SIZE 100 #define DUPLICATE -1 //表示已有该元素 typedef struct { int key[SIZE]; int count; int sizeindex; }HashTable; int SearchHash(HashTable H,int keynum,int &position,int &count) { position=Hash(key); while(H.key[position]!=0&&H.key[postion]!=keynum) collision(position,++count);//求下一个探测地址 if(keynum==H.key[position]) return 1; else return 0; } int InsertHash(HashTable &H,int e) { int count=0,position; if(SearchHash(H,e,position,count)) return DUPLICATE; else if(count<hashsize[H.sizeindex]/2) { H.key[position]=e;++H.count;return 1; } else { RecreateHashTable(H);return 0;//重建哈希表 } }

 

 

 

转自：http://yanghao18161.blog.163.com/blog/static/59451671200934102816295/

#include "stdafx.h" #include "LinkTable.h" #define MAX_KEY 500 //------------------------------数组实现部分---------------------------------- /* 无序数组顺序查找算法函数nsq_Order_Search<用数组实现> 参数描述： int array[] :被查找数组 int n :被查找数组元素个数 int key :被查找的关键值 返回值: 如果没有找到: nsq_Order_Search = -1 否则: nsq_Order_Search = key数组下标 */ int nsq_Order_Search(int array[],int n,int key) { int i; array[n] = key; /*for循环后面的分号必不可少*/ for(i=0;key!=array[i];i++); return(i<n?i:-1); } /* 有序数组顺序查找算法函数sq_Order_Search<用数组实现> 参数描述： int array[] :被查找数组 int n :被查找数组元素个数 int key :被查找的关键值 返回值: 如果没有找到: sq_Order_Search = -1 否则: sq_Order_Search = key数组下标 */ int sq_Order_Search(int array[],int n,int key) { int i; array[n] = MAX_KEY; /*for循环后面的分号必不可少*/ for(i=0;key>array[i];i++); if(i<n && array[i] == key) return(i); else return(-1); } /* 有序数组二分查找算法函数sq_Dichotomy_Search0<用数组实现> 参数描述： int array[] :被查找数组 int n :被查找数组元素个数 int key :被查找的关键值 返回值: 如果没有找到: sq_Dichotomy_Search0 = -1 否则: sq_Dichotomy_Search0 = key数组下标 */ int sq_Dichotomy_Search0(int array[],int n,int key) { int low,high,mid; low = 0; high = n - 1; while(low<=high) { mid = (high+low)/2; if(array[mid] == key) return(mid); /*key>array[mid] 表明要求查找的值在[mid+1,high]*/ /*否则,在[low,mid-1]*/ if(key > array[mid]) low = mid + 1; else high = mid - 1; } return(-1); } /* 有序数组插值查找算法函数sq_Dichotomy_Search1<用数组实现> (插值查找算法是二分查找算法的改进) 参数描述： int array[] :被查找数组 int n :被查找数组元素个数 int key :被查找的关键值 返回值: 如果没有找到: sq_Dichotomy_Search1 = -1 否则: sq_Dichotomy_Search1 = key数组下标 */ int sq_Dichotomy_Search1(int array[],int n,int key) { int low,high, //二分数组的上,下标 pos; //查找码的大致(估算)位置 low = 0; high = n-1; while(low <= high) { pos = (key-array[low])/(array[high]-array[low])*(high-low)+low; /*找到关键值,中途退出*/ if(key == array[pos]) return(pos); if(key > array[pos]) low = pos + 1; else high = pos - 1; } /*没有找到,返回-1*/ return(-1); } //------------------------------数组实现部分---------------------------------- //------------------------------链表实现部分---------------------------------- /* 无序链表顺序查找算法函数nlk_Order_Serach<用链表实现> [查找思想:遍历链表的所有节点] 参数描述： Node *head :被查找链表的首指针 int key :被查找的关键值 返回值: 如果没有找到: nlk_Order_Serach = NULL 否则: nlk_Order_Serach = 键值为key的节点的指针 */ Node *nlk_Order_Serach(Node *head,int key) { for(;head!=NULL && head->data != key;head = head->link); return(head); } /* 有序链表顺序查找算法函数lk_Order_Serach<用链表实现> [查找思想:依次遍历链表的节点,发现节点不在key的范围时提前结束查找] 参数描述： Node *head :被查找链表的首指针 int key :被查找的关键值 返回值: 如果没有找到: lk_Order_Serach = NULL 否则: lk_Order_Serach = 键值为key的节点的指针 */ Node *lk_Order_Search(Node *head,int key) { for(;head!=NULL && head->data < key;head=head->link); /*当遍历指针为NULL或没有找到键值为key的节点,返回NULL(表明没有找到)*/ /*否则,返回head(表明已经找到)*/ return(head==NULL || head->data != key ? NULL : head); } /* 有序链表动态查找算法函数lk_Dynamic_Search<用链表实现> [查找思想:依次遍历链表的节点,发现节点不在key的范围时提前结束查找] 参数描述： Node *head: 被查找链表的首指针 Node **p; 键值为key的节点的前驱指针(回传参数) Node **q: 键值为key的节点指针(回传参数) int key : 被查找的关键值 注意: 当 *p == NULL 且 *q != NULL,链表的首节点键值为key 当 *p != NULL 且 *q != NULL,链表的中间(非首,尾)节点键值为key 当 *p != NULL 且 *q == NULL,链表的尾节点键值为key 当 *p == NULL 且 *q == NULL,链表是空链表 */ void lk_Dynamic_Search(Node *head,Node **p,Node **q,int key) { Node *pre,*cur; pre = NULL; cur = head; for(;cur != NULL && cur->data < key;pre = cur,cur = cur->link) *p = pre; *q = cur; } /* 有序链表动态插入算法函数lk_Dynamic_Insert<用链表实现> 参数描述： Node *head: 被插入链表的首指针 int key : 被插入的关键值 返回值: lk_Dynamic_Search = 插入键值为key的节点后的链表首指针 */ Node *lk_Dynamic_Insert(Node *head,int key) { Node *x, //插入节点的前驱节点 *y, //插入节点的后续节点 *p; //插入的节点 p = (Node *)malloc(sizeof(Node)); p->data = key; p->link = NULL; lk_Dynamic_Search(head,&x,&y,key); if(x==NULL) { p->link = x; head = p; } else { p->link = x->link; x->link = p; } ListLinkTable(head,"插入节点"); return(head); } /* 有序链表动态删除算法函数lk_Dynamic_Delete<用链表实现> 参数描述： Node *head: 被删除链表的首指针 int key : 被删除的关键值 返回值: lk_Dynamic_Delete = 删除键值为key的节点后的链表首指针 */ Node *lk_Dynamic_Delete(Node *head,int key) { Node *x, //删除节点的前驱节点 *y; //删除的节点 lk_Dynamic_Search(head,&x,&y,key); if(x==NULL) /*因为x=NLLL时,y指向首指针*/ head = y->link; else x->link = y->link; free(y); ListLinkTable(head,"删除节点"); return(head); } //------------------------------链表实现部分---------------------------------- int main(int argc, char* argv[]) { Node *head; //Node *p,*x,*y; int KEY; int count,i; //int result; KEY = 11; //PrintArrayValue(TestArray2,DEFAULT_ARRAY_SIZE,"原始"); //result = sq_Dichotomy_Search1(TestArray2,DEFAULT_ARRAY_SIZE,KEY); //printf("查找结果是：数组[%d] = %d/n",result,TestArray2[result]); head = CreateLinkTable(DEFAULT_ARRAY_SIZE,TestArray2); ListLinkTable(head,"原始"); /* p = lk_Order_Search(head,KEY); if(p==NULL) printf("/n查找结果是：指定链表中没有[数据域 = %d]的节点!/n",KEY); else printf("/n查找结果是：节点.Data = %d/t节点.Link = %d/t节点.Addr = %d/n",p->data,p->link,p); */ printf("输入插入节点的个数：/t"); scanf("%d",&count); for(i=0;i<count;i++) { printf("输入插入节点的数据域：/t"); scanf("%d",&KEY); lk_Dynamic_Insert(head,KEY); } do { printf("输入删除节点的数据域：/t"); scanf("%d",&KEY); lk_Dynamic_Delete(head,KEY); }while(head!=NULL); printf("/n/n应用程序正在运行....../n"); return 0; }   

//二分查找 //文件名:exp9-2.cpp #include <stdio.h> #define MAXL 100 //定义表中最多记录个数 typedef int KeyType; typedef char InfoType[10]; typedef struct { KeyType key; //KeyType为关键字的数据类型 InfoType data; //其他数据 } NodeType; typedef NodeType SeqList[MAXL]; //顺序表类型 int BinSearch(SeqList R,int n,KeyType k) //二分查找算法 { int low=0,high=n-1,mid,count=0; while (low<=high) { mid=(low+high)/2; printf("第%d次查找:在[%d,%d]中查找到元素R[%d]:%d/n",++count,low,high,mid,R[mid].key); if (R[mid].key==k) //查找成功返回 return mid; if (R[mid].key>k) //继续在R[low..mid-1]中查找 high=mid-1; else low=mid+1; //继续在R[mid+1..high]中查找 } return -1; } void main() { SeqList R; KeyType k=4; int a[]={11,2,34,4,57,6,73,8,95,110},i,n=10; for (i=0;i<n;i++) //建立顺序表 R[i].key=a[i]; printf("/n"); if ((i=BinSearch(R,n,k))!=-1) printf("元素%d的位置是%d/n",k,i); else printf("元素%d不在表中/n",k); printf("/n"); } //二分查找2 #include <iostream.h> #include <conio.h> #define ElemType int #define MaxSize 100 struct Node { //其他字段 ElemType key; //key为关键字 }; int BiSearch(Node r[],int n,ElemType k) { int low=0,hig=n-1,mid; while(low<=hig) { mid=(low +hig)/2; //取区间中点 if (r[mid].key == k) return(mid); //查找成功 else if (r[mid].key>k) hig=mid-1; //在左子区间中查找 else low=mid+1; //在右子区间中查找 } return(-1); } int main() { int a[] = {1,2,4,6,8,19,23,28,37,56}; Node r[MaxSize]; int pos; int k; for(int i=0;i<10;i++) r[i].key = a[i]; cout<<"请输入要查找的数："; cin>>k; pos = BiSearch(r,10,k); if (pos>=0) cout<<"查找成功！"; else cout<<"查找失败！"; getch(); return 0; }

 

 

 

 

//bstree

 

#include <iostream.h> #include <conio.h> #define MaxSize 100 #define DataType int class Node { friend class BSTree; friend void Visit(Node*); private: Node* lChild; Node* rChild; //左子树指针 DataType data; //,右子树指针 public: Node(){ lChild = NULL; rChild = NULL; } Node(DataType item, Node *left = NULL,Node *right = NULL){ data = item; lChild = left; rChild = right; } ~Node(){} }; void Visit(Node* p) { cout<<p->data <<" "; } class BSTree { public: BSTree(); //构造函数 BSTree(int No[],char data[],int n);//构造函数 void InOrder(Node* r,void Visit(Node*)); //中序遍历的递归算法 Node* Search(Node* bt,const DataType x); void Insert(Node* r,const DataType x); void Delete(Node* r,const DataType x); void Destroy(Node *r); Node* getRoot(); void Print(Node* r,int level); private: Node* root; }; //创建二叉树二叉链表 BSTree::BSTree() { // root = new Node(4); root = NULL; } BSTree::BSTree(int No[],char data[],int n) { Node* s[MaxSize]; Node *q,*t; int i,j; DataType x; for(int i=0;i<n;i++) { q = new Node(data[i]); s[i] = q; if(No[i]==0) root = q; else { j = (No[i]-1)/2; if ((No[i]-1)%2==0) s[j]->lChild = q; else s[j]->rChild = q; } } } Node* BSTree::getRoot() { return root; } //二叉树中序遍历 递归算法 void BSTree::InOrder(Node* r,void Visit(Node*)) { if(r!=NULL) { InOrder(r->lChild,Visit); Visit(r); InOrder(r->rChild,Visit); } } void BSTree::Print(Node* r, int level) { //二叉树r第level层结点数据域值的横向显示 if(r != NULL) { //二叉树r->rChild第level+1层结点数据域值的横向显示 Print(r->rChild , level+1); if(level != 0) { //走过6*(level-1)个空格 for(int i = 0; i < 6*(level-1); i++) cout<<" "; cout << " ----"; } cout << r->data << endl; //二叉树r->lCHild第level+1层结点数据域值的横向显示 Print(r->lChild, level+1); } } void BSTree::Destroy(Node *r) { if(r ==NULL) return; else { if(r->lChild != NULL) Destroy(r->lChild); if(r->rChild != NULL) Destroy(r->rChild); cout << r->data << " "; //此语句只是为了方便测试 delete r; } } Node* BSTree::Search(Node* r,const DataType x){ Node *p; p = r; while(p!=NULL) { if (p->data==x) return r; //查找成功返回 else if(p->data>x) p = p->lChild; //在左子树中查找数据元素x else p = p->rChild; //在右子树中查找数据元素x } return NULL; /*查找失败返回*/ } void BSTree::Insert(Node* r,const DataType x) { Node* p; if(r==NULL) { root = new Node(x); } else if(x == r->data) { cout<<x<<" 元素已经存在！"<<endl; return; } else if(x<r->data) { if(r->lChild == NULL) { p = new Node(x); r->lChild = p; } else Insert(r->lChild,x); } else if(x>r->data) { if(r->rChild == NULL) { p = new Node(x); r->rChild = p; } else Insert(r->rChild,x); } } void BSTree::Delete(Node* r,const DataType x)//有待改进 { Node* p; if(r!=NULL) { if(x == r->data) { if(r->lChild!=NULL && r->rChild!=NULL) { Node* min; min = r->rChild; while(min->lChild!=NULL) min = min->lChild; r->data = min->data; Delete(r->rChild,min->data); } else { p = r; if(r->lChild==NULL) r = r->rChild; else if(r->rChild==NULL) r = r->lChild; delete p; } } else if(x<r->data) Delete(r->lChild,x); else if(x>r->data) Delete(r->rChild,x); } } int main() { DataType x; //针对262页图10－5 //int No[7] = {0,1,2,3,5,6,8}; BSTree bt; int data[9] = {4,5,7,2,1,9,8,11,3}; for(int i=0;i<9;i++) bt.Insert(bt.getRoot(),data[i]); cout<<"中序遍历结果："; bt.InOrder(bt.getRoot(),Visit); cout<<endl; cout<<"请输入要查找的元素："; cin>>x; if (bt.Search(bt.getRoot(),x)!=NULL) cout<<"成功找到！！！"<<endl; else cout<<"查找失败！！！"<<endl; bt.Insert(bt.getRoot(),6); bt.InOrder(bt.getRoot(),Visit); cout<<endl; //cout<<"撤销二叉树,撤销次序："; //bt.Destroy(bt.getRoot()); getch(); }

 

#include <iostream.h> #include <conio.h> #include <iomanip.h> #define DataType int const int TableSize = 16; const int p = 13; enum State {Empty,Active,Deleted}; struct HashItem { DataType key; State info; }; int H(DataType x) { return x%p; } int Collision(DataType x,int i) { return (H(x)+i)%TableSize; } class HashTable { public: HashTable(); int Find(const DataType& x); bool Insert(const DataType& x); bool Delete(const DataType& x); bool Exist(const DataType& x); HashItem GetValue(int i); void Clear(); void Print(); private: HashItem ht[TableSize]; int currentSize; }; HashTable::HashTable() { for(int i=0;i<TableSize;i++) { ht[i].info = Empty; } } int HashTable::Find(const DataType& x) { int i =1,j; j = H(x); while((ht[j].info == Active) && (ht[j].key != x)) { j = Collision(x,i); i++; } if(ht[j].info == Active) return j; else return -1; } bool HashTable::Insert(const DataType& x) { int i =1,j; if(currentSize == TableSize) { cout<<"Hash表已满，不能插入！！"<<endl; return false; } else { j = H(x); while(ht[j].info == Active) { j = Collision(x,i); i++; } ht[j].key = x; ht[j].info = Active; currentSize++; return true; } } bool HashTable::Delete(const DataType& x) { int i =1,j; if(currentSize == 0) { cout<<"Hash表已空，不能删除！！"<<endl; return false; } else { j = H(x); while((ht[j].info == Active)&&(ht[j].key!=x)) { j = Collision(x,i); i++; } if(ht[j].info!=Active) { cout<<"元素不存在，不能删除！！"<<endl; return false; } else { ht[j].info = Deleted; currentSize--; return true; } } } void HashTable::Print() { for(int i=0;i<TableSize;i++) cout<<setw(4)<<i; cout<<endl; for(int i=0;i<TableSize;i++) { if(ht[i].info == Active) cout<<setw(4)<<ht[i].key; else if (ht[i].info == Deleted) cout<<" -"; else cout<<" ^"; } cout<<endl; } void main() { HashTable myHash; DataType x; DataType a[] = {19,14,23,1,68,20,84,27,55,11,10,79}; for(int i=0;i<12;i++) { myHash.Insert(a[i]); } myHash.Print(); cout<<"请输入要查找的元素："; cin>>x; if(myHash.Find(x)>=0) cout<<"成功找到！！"<<endl; else cout<<"查找失败！！"<<endl; myHash.Delete(84); myHash.Print(); getch(); }

 

 

#include <iostream.h> #include <conio.h> #define ElemType int #define MaxSize 100 struct Node { //其他字段 ElemType key; //key为关键字 }; int SeqSearch(Node r[],int n,ElemType k) { int i = 0; while ((i<n) && (r[i].key!=k)) i++; if(i<n) return i; else return -1; } int SeqSearch1(Node r[],int n,ElemType k) { int i = 0; r[n].key = k; while (r[i].key!=k) i++; if(i<n) return i; else return -1; } int main() { int a[] = {12,23,34,8,76,34,49,102,23,14}; Node r[MaxSize]; int pos; int k; for(int i=0;i<10;i++) r[i].key = a[i]; cout<<"请输入要查找的数："; cin>>k; pos = SeqSearch1(r,10,k); if (pos>=0) cout<<"查找成功！成功位置＝"<<pos; else cout<<"查找失败！"; getch(); return 0; }

 

 

hash-线性探测再散列.cpp

#include<stdio.h> #include<stdlib.h> #include<time.h> #define MAXSIZE 100 #define OK 1 #define NUM 20 #define ERROR -1 typedef struct{ int key; int num; }HashArray; HashArray HL[MAXSIZE]; int Prime[25]={24,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,79,83,89,97}; int Search(int m) { int i; for(i=1;1<Prime[0]-1;i++) { if(Prime[i]<=m&&Prime[i+1]>m)return Prime[i]; } return ERROR; } void Create_hash(int k[],int p,int m) { // a=(HashArray *)malloc(sizeof(HashArray)); int i,d,y,count=0; for(i=0;i<m;i++) { HL[i].num=0; HL[i].key=-1; } for(i=1;i<=k[0];i++) { d=k[i]%p; y=d; count++; while(HL[y].key!=-1){y=(y+1)%m;count++;} HL[y].key=k[i]; HL[y].num=count; count=0; } } void Print(int m) { int i; for(i=0;i<m;i++) printf("%3d%3d%3d/n",i,HL[i].num,HL[i].key); } void main() { int p,i,k[NUM+2]; k[0]=NUM; srand((unsigned)time(NULL)); for(i=1;i<=NUM;i++) { k[i]=rand()%100; printf("%4d",k[i]); } printf("/n"); p=Search(NUM); Create_hash(k,p,k[0]); Print(k[0]); }

 

 

 

顺序查找-哨兵顶端.cpp

#include<stdio.h> #include<stdlib.h> int Index(int a[],int x) {int i=1; a[a[0]+1]=x; while(a[i]!=a[a[0]+1]) i++; if(i>=a[0])printf("Didn't find it!"); else return i; } int main() { int A[11],i; randomize(); A[0]=9; for(i=1;i<=10;i++) {A[i]=random(10); printf("%d ",A[i]); } printf("/n%d/n",Index(A,5)); return 0;}

 

顺序查找-哨兵基端.cpp

 

#include<stdio.h> #include<stdlib.h> int Index(int a[],int x,int n) {int i=1; a[0]=x; while(a[i]!=a[0]) i++; if(i>=n)printf("Didn't find it!"); else return i; } int main() { int A[11],i; randomize(); for(i=1;i<=10;i++) {A[i]=random(10); printf("%d ",A[i]); } printf("/n%d/n",Index(A,5,10)); return 0; }

 

 

折半查找.cpp

#include<stdio.h> int Bin_search(int a[],int i,int j,int x) { int mid; while(i<=j) { mid=(i+j)/2; if(x==a[mid])return i; else if(x<a[mid])j=mid-1; else i=mid+1; } return 0; } int main() { int a[10],i; a[0]=9; printf("This is Bin_search,please input 9 numbers in increasing order!/n"); for(i=1;i<=9;i++) scanf("%d",&a[i]); printf("position is %d",Bin_search(a,1,9,25)); return 0;}

 

折半查找递归.cpp

#include<stdio.h> int Bin_search(int a[],int i,int j,int x) { int mid; while(i<=j) { mid=(i+j)/2; if(x==a[mid])return mid; else if(x<a[mid])Bin_search(a,i,mid-1,x); else Bin_search(a,mid+1,j,x); } } int main() { int a[10],i; printf("This is Bin_search,please input 9 numbers in increasing order!/n"); for(i=1;i<=9;i++) scanf("%d",&a[i]); printf("position is %d/n",Bin_search(a,1,9,25)); return 0;}