查找排序总结.doc

===============================总结：几种常见的查找算法*****************************************************************************//静态查找——顺序查找*****************************************************************************//静态查找——索引顺序表，效果比顺序表查找较好，但远不及折半查找*****************************************************************************//静态查找——折半查找#include "stdio.h"#define SIZE 11int 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 11struct 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],N