7.数据结构-顺序查找算法的实现（C语言）

数据结构算法

#include<stdio.h> //定义顺序表 typedef struct { int key; int count; }RecType; int search(RecType array[], int n, int key) { int i = 0; while(i<n && array[i].key!=key) { i++; } if(i>=n) { return 0; }else { return i+1; } } void main() { int key = 5; RecType a[5] = {{6},{5},{4},{2},{9}}; a->count = 5; int result = search(a,a->count,key); printf("%d", result); }

普通c语言的实现

#include<stdio.h> int search(int array[], int n, int key) { int i = 0; while(i<n && array[i]!=key) { i++; } if(i>=n) { return 0; }else { return i+1; } } void main() { int n = 5,key = 5; int a[5] = {6,5,4,2,9}; int result = search(a,n,key); printf("%d", result); }