【数据结构-查找】C语言实现线性表的顺序查找和折半查找

顺序查找

//顺序查找
int Search_Seq01(SSTable ST,KeyType key)
{
	for(int i=ST.length;i>=1;i--)
		if(ST.R[i].key==key) return i;
	return 0;
}

设置监视哨的顺序查找

//设置监视哨的顺序查找
int Search_Seq02(SSTable ST,KeyType key)
{
	int i;
	ST.R[0].key = key;
	for(i=ST.length;ST.R[i].key!=key;i--);
	return i;
}

非递归折半查找

//非递归折半查找
int Search_Bin01(SSTable ST,KeyType key)
{
	int low=1,high=ST.length,mid;    //low和high分别为表的上下界 
	while(low<=high)
	{
		mid=(low+high)/2;     //取中间位置 
		if(ST.R[mid].key==key) return mid;    //找到给定值 
		else if(ST.R[mid].key>key) high = mid-1;   //前往前一个子表 
		else low = mid + 1;    //前往后一个子表 
	}
	return 0;
}

递归折半查找

//递归折半查找
int Search_Bin02(SSTable ST,KeyType key,int low,int high) 
{
	int mid = (low+high)/2;
	if(ST.R[mid].key==key) return mid;   //找到给定值 
	else if(ST.R[mid].key>key) Search_Bin02(ST,key,low,mid-1);   //前一个子表递归查找 
	else Search_Bin02(ST,key,mid+1,high);        //后一个子表递归查找 
}

代码整合测试

#include <stdio.h>
#include <stdlib.h>

#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 20

typedef int Status;
typedef int KeyType;
typedef int InfoType;
typedef struct
{
	KeyType key;   //关键字域 
	InfoType otherInfo;   //其他域 
}ElemType;
typedef struct
{
	ElemType *R;   //储存空间基地址 
	int length;    //当前长度 
}SSTable;

//初始化一个自定义类型线性表
Status InitTable(SSTable *ST)
{
	ST->R = (ElemType *)malloc(MAXSIZE*sizeof(ElemType));    //开辟空间，别漏了sizeof(ElemType) 
	if(ST->R == NULL) return ERROR;
	ST->length =0;
	return OK;
}

//顺序查找
int Search_Seq01(SSTable ST,KeyType key)
{
	for(int i=ST.length;i>=1;i--)
		if(ST.R[i].key==key) return i;
	return 0;
}

//设置监视哨的顺序查找
int Search_Seq02(SSTable ST,KeyType key)
{
	int i;
	ST.R[0].key = key;
	for(i=ST.length;ST.R[i].key!=key;i--);
	return i;
}

//非递归折半查找
int Search_Bin01(SSTable ST,KeyType key)
{
	int low=1,high=ST.length,mid;    //low和high分别为表的上下界 
	while(low<=high)
	{
		mid=(low+high)/2;     //取中间位置 
		if(ST.R[mid].key==key) return mid;    //找到给定值 
		else if(ST.R[mid].key>key) high = mid-1;   //前往前一个子表 
		else low = mid + 1;    //前往后一个子表 
	}
	return 0;
}

//递归折半查找
int Search_Bin02(SSTable ST,KeyType key,int low,int high) 
{
	int mid = (low+high)/2;
	if(ST.R[mid].key==key) return mid;   //找到给定值 
	else if(ST.R[mid].key>key) Search_Bin02(ST,key,low,mid-1);   //前一个子表递归查找 
	else Search_Bin02(ST,key,mid+1,high);        //后一个子表递归查找 
}

int main()
{
	SSTable ST;
	InitTable(&ST);    //初始化顺序表 
	for(int i=1;i<=20;i++)   //循环赋值 
	{
		ST.R[i].key = i;
		ST.length+=1;
	}
	printf("%d\n",ST.R[Search_Seq02(ST,2)].key);    //由上往下对应查找 
	printf("%d\n",Search_Seq01(ST,3));
	printf("%d\n",Search_Bin01(ST,9));
	printf("%d",Search_Bin02(ST,14,1,20));
	return 0;
}