顺序查找( Sequential Search ) 又叫线性查找,是最基本的查找技术,它的查找过程是:从表中第一个(或最后一个)记录开始,逐个进行记录的关键字和给定值比较,若某个记录的关键字和给定值相等,则查找成功,找到所查的记录;如果直到后一个(或第一个)记录,其关键字和给定信比较都不等时,则表中没有新金录,査找不成功。
1.数组实现
#include<stdio.h>
#include<stdlib.h>
typedef int KeyType;
typedef char InfoType;
typedef struct
{
KeyType key;
InfoType info;
}Key;
void Search_Seq01(Key *K, KeyType key, int len)//顺序查找
{
int i;
for(i = 1; i < len; i++)
if(K[i].key == key)
{
printf("关键字信息为:%c\n", K[i].info);
break;
}
}
void Search_Seq02(Key *K, KeyType key, int len)//设置监视哨查找
{
int i;
K[0].key = key;
for(i = len; K[i].key != key; i--);
printf("关键字信息为:%c\n", K[i].info);
}
int main()
{
Key *K;
int i, M;
printf("请输入关键字数:");
scanf("%d", &M);
K = (Key *)malloc((M+1) * sizeof(Key));
//测试用例:1 a 2 b 3 c 4 d 5 e 6 f 7 g 8 h 9 i 10 j
printf("请输入关键字及关键字信息:\n");
for(i = 1; i <= M; i++)
scanf("%d %c", &K[i].key, &K[i].info);
printf("顺序查找\nkey = 4\n");
Search_Seq01(K, 4, M);
printf("\n");
printf("设置监视哨顺序查找\nkey = 5\n");
Search_Seq02(K, 5, M);
printf("\n");
return 0;
}
2.顺序表实现
#include<stdio.h>
#include<stdlib.h>
#define MAX 20
typedef int KeyType;
typedef char InfoType;
typedef struct
{
KeyType key;
InfoType info;
}ElemType;
typedef struct
{
ElemType *R;
int length;
}List,*SqList;
void InitList(SqList *L)
{
(*L) = (List *)malloc(sizeof(List));//给顺序表分配空间
(*L)->R = (ElemType *)malloc(MAX * sizeof(ElemType));//给数据域分配空间
(*L)->length = 0;
}
void CreateList(SqList *L)
{
int i;
for(i = 1; i <= 10; i++)
{
(*L)->R[i].key = i;//赋值
(*L)->R[i].info = 'a'+i-1;//赋值
(*L)->length++;
}
}
void DispList(SqList L)
{
int i;
for(i = 1; i <= L->length; i++)//关键字遍历
printf("%d ", L->R[i].key);
printf("\n");
for(i= 1; i <= L->length; i++)//关键字信息遍历
printf("%c ",L->R[i].info);
printf("\n\n");
}
int Search_Seq01(SqList L, KeyType key)//顺序查找
{
int i;
for(i = 1; i <= L->length; i++)//判断语句一
if(L->R[i].key == key)//判断语句二
return i;
return 0;
}
int Search_Seq02(SqList L, KeyType key)//设置监视哨顺序查找
{
int i;
L->R[0].key = key; //占用第一个数组位置做监视哨
for(i = L->length -1; L->R[i].key != key; i--);
//相比普通顺序查找,少了一个判断条件
//也就相当于快了将近一半的时间
return i;
}
int main()
{
int m, n;
SqList L;
InitList(&L);
CreateList(&L);
printf("顺序表创建完成!\n");
printf("顺序表表长 = %d\n", L->length);
printf("关键字信息遍历:\n");
DispList(L);
m = Search_Seq01(L, 4);
printf("顺序查找关键字key = 4\n");
printf("关键字位置:%d\n", m);
printf("关键字信息:%c\n\n", L->R[m].info);
n = Search_Seq02(L, 5);
printf("监视哨顺序查找关键字key = 5\n");
printf("关键字位置:%d\n", n);
printf("关键字信息:%c\n", L->R[n].info);
return 0;
}
3.单链表实现
#include<stdio.h>
#include<stdlib.h>
typedef int KeyType;
typedef char InfoType;
typedef struct LNode
{
KeyType Key;
InfoType info;
struct LNode *next;
}LNode, *LinkList;
//初始化单链表
void InitList(LinkList *L)
{
(*L) = (LNode *)malloc(sizeof(LNode));
(*L)->next = NULL;
printf("单链表已初始化!\n");
}
//创建单链表
void CreateList(LinkList *L)
{
int i;
LinkList p = *L;
for(i = 1; i <= 10; i++)
{
LNode *s;//定义一个新结点
s = (LNode *)malloc(sizeof(LNode));//为结点分配空间
//给结点赋值关键字及信息
s->Key = i;
s->info = 'a'+i-1;
//将新结点依次接入单链表
s->next = NULL;
p->next = s;
p = p->next;
}
printf("单链表创建成功!\n");
}
void DispList(LinkList *L)//遍历单链表
{
LinkList p = *L, q = *L;
while(p->next)
{
p = p->next;
printf("%d ", p->Key);//关键字
}
printf("\n");
while(q->next)
{
q = q->next;
printf("%c ", q->info);//关键字信息
}
printf("\n\n");
}
LinkList Search_Seq01(LinkList *L, KeyType key)//顺序查找
{
LinkList p = *L;
while(p->next)
{
p = p->next;
if(p->Key == key)
return p;
}
return p;
}
LinkList Search_Seq02(LinkList *L, KeyType key)//监视哨查找
{
LinkList p;
for(p = (*L)->next; p->Key != key; p = p->next);
return p;
}
int main()
{
LinkList L;
InitList(&L);
CreateList(&L);
printf("遍历单链表:\n");
DispList(&L);
LinkList m, n;
printf("顺序查找\nkey = 2\n");
m = Search_Seq01(&L, 2);
if(m)
printf("关键字信息为:%c\n\n", m->info);
else
printf("查找失败!\n");
printf("监视哨顺序查找\nkey = 8\n");
n = Search_Seq01(&L, 8);
if(n)
printf("关键字信息为:%c\n\n", n->info);
else
printf("查找失败!\n\n");
return 0;
}