查找
来源:互联网 发布:cnas 软件测试报告 编辑:程序博客网 时间:2024/05/01 03:51
1.折半查找
int binarySearch(int a[],const int x,int n)
{
int left = 0;
int right = n-1;
while(left<=right)
{
int middle=(left+right)/2;
if(x == a[middle]) return middle;
if(x > a[middle]) left = middle+1;
else right = middle-1;
}
return -1;
}
2.二叉排序树
#include <stdlib.h>
typedef struct BTN{
int data;
struct BTN *l,*r;
}Node,*BiTree;
int searchBST(BiTree root,int key,BiTree parent,BiTree *p)
{
if(!root)
{
*p=parent;
return 0;
}
else if(key == root->data)
{
*p=root;
return 1;
}
else if(key < root->data) return searchBST(root->l,key,root,p);
else return searchBST(root->r,key,root,p);
}
int insertBST(BiTree *tree,int e)
{
BiTree p,s;
if(!searchBST(*tree,e,NULL,&p))
{
s=(BiTree)malloc(sizeof(Node));
s->data=e;
s->l=s->r=NULL;
if(!p) *tree=s;
else if(e < p->data) p->l=s;
else p->r=s;
return 1;
}
else return 0;
}
void inOrder(BiTree root)
{
if(root==NULL) return;
else {inOrder(root->l);
printf("/t%d/n",root->data);
inOrder(root->r);
}
}
main()
{
BiTree tree=NULL;
int i=0;
for(;i<10;i++)
insertBST(&tree,i);
inOrder(tree);
}
int binarySearch(int a[],const int x,int n)
{
int left = 0;
int right = n-1;
while(left<=right)
{
int middle=(left+right)/2;
if(x == a[middle]) return middle;
if(x > a[middle]) left = middle+1;
else right = middle-1;
}
return -1;
}
2.二叉排序树
#include <stdlib.h>
typedef struct BTN{
int data;
struct BTN *l,*r;
}Node,*BiTree;
int searchBST(BiTree root,int key,BiTree parent,BiTree *p)
{
if(!root)
{
*p=parent;
return 0;
}
else if(key == root->data)
{
*p=root;
return 1;
}
else if(key < root->data) return searchBST(root->l,key,root,p);
else return searchBST(root->r,key,root,p);
}
int insertBST(BiTree *tree,int e)
{
BiTree p,s;
if(!searchBST(*tree,e,NULL,&p))
{
s=(BiTree)malloc(sizeof(Node));
s->data=e;
s->l=s->r=NULL;
if(!p) *tree=s;
else if(e < p->data) p->l=s;
else p->r=s;
return 1;
}
else return 0;
}
void inOrder(BiTree root)
{
if(root==NULL) return;
else {inOrder(root->l);
printf("/t%d/n",root->data);
inOrder(root->r);
}
}
main()
{
BiTree tree=NULL;
int i=0;
for(;i<10;i++)
insertBST(&tree,i);
inOrder(tree);
}