衡量指标:ASL衡量查找算法的效率。顺序查找是在顺序表中按照索引顺序依次查找。
顺序查找针对顺序表实现,普通顺序查找需要判断两个条件,是否读取越界和元素是否和目标相等。
带哨兵位的顺序查找是将0号位置用来存储目标值,从最后一位开始往回查找,找到则返回位置索引,如果一直没找到会遍历到0号位置,返回索引值为0。时间复杂度为O(n)。
普通顺序查找:
#include<stdio.h>
#include<stdlib.h>
typedef struct List
{
int* data;
int length;
int num;
}List;
List* initList(int length)
{
List* list = (List*)malloc(sizeof(List));
list->length = length;
list->data = (int*)malloc(sizeof(int) * list->length);
list->num = 0;
return list;
}
void listAdd(List* list, int data)
{
list->data[list->num] = data;
list->num++;
}
int Search(List* list, int key)
{
for (int i = 0; i < list->num; i++)
{
if (list->data[i] == key)
{
return i;
}
}
return -1;
}
void printList(List* list)
{
for (int i = 0; i < list->num; i++)
{
printf("%d->", list->data[i]);
}
printf("NULL\n");
}
int main()
{
List* list = initList(5);
listAdd(list, 1);
listAdd(list, 2);
listAdd(list, 3);
listAdd(list, 4);
listAdd(list, 5);
printList(list);
int ret = Search(list, 5);
if (ret != -1)
{
printf("找到了位置为%d\n", ret);
}
else
{
printf("没找到\n");
}
system("pause");
return 0;
}
测试结果:
带哨兵位顺序查找:
#include<stdio.h>
#include<stdlib.h>
typedef struct List
{
int* data;
int length;
int num;
}List;
List* initList(int length)
{
List* list = (List*)malloc(sizeof(List));
list->length = length;
list->data = (int*)malloc(sizeof(int) * list->length);
list->num = 1;
return list;
}
void listAdd(List* list, int data)
{
list->data[list->num] = data;
list->num++;
}
void printList(List* list)
{
for (int i = 0; i < list->num; i++)
{
printf("%d->", list->data[i]);
}
printf("NULL\n");
}
int Search(List* list, int key)
{
int i;
list->data[0] = key;
printList(list);
for (i = list->num - 1; list->data[i] != key; i--);//写法很巧妙
return i;
}
int main()
{
List* list = initList(5);
listAdd(list, 4);
listAdd(list, 5);
listAdd(list, 6);
listAdd(list, 7);
printList(list);
int ret = Search(list, 8);
if (ret != 0)
{
printf("找到了位置为%d\n", ret);
}
else
{
printf("没找到\n");
}
system("pause");
return 0;
}
测试结果: