第十三周项目1验证算法

来源：互联网发布：linux sip服务器编辑：程序博客网时间：2024/05/21 10:46

【项目1 - 验证算法】
运行并本周视频中所讲过的算法，观察结果并领会算法。
1、认真阅读并验证折半查找算法。请用有序表{12,18,24,35,47,50,62,83,90,115,134}作为测试序列，分别对查找90、47、100进行测试。

代码实现：

（1）查找90

#include <stdio.h>#define MAXL 100typedef int KeyType;typedef char InfoType[10];typedef struct{    KeyType key;                //KeyType为关键字的数据类型    InfoType data;              //其他数据} NodeType;typedef NodeType SeqList[MAXL];     //顺序表类型int BinSearch(SeqList R,int n,KeyType k){    int low=0,high=n-1,mid;    while (low<=high)    {        mid=(low+high)/2;        if (R[mid].key==k)      //查找成功返回            return mid+1;        if (R[mid].key>k)       //继续在R[low..mid-1]中查找            high=mid-1;        else            low=mid+1;          //继续在R[mid+1..high]中查找    }    return 0;}int main(){    int i,n=10;    int result;    SeqList R;    KeyType a[]= {12,18,24,35,47,50,62,83,90,115,134},x=90;    for (i=0; i<n; i++)        R[i].key=a[i];    result = BinSearch(R,n,x);    if(result>0)        printf("序列中第 %d 个是 %d\n",result, x);    else        printf("木有找到！\n");    return 0;}

（2）查找47

#include <stdio.h>#define MAXL 100typedef int KeyType;typedef char InfoType[10];typedef struct{    KeyType key;                //KeyType为关键字的数据类型    InfoType data;              //其他数据} NodeType;typedef NodeType SeqList[MAXL];     //顺序表类型int BinSearch(SeqList R,int n,KeyType k){    int low=0,high=n-1,mid;    while (low<=high)    {        mid=(low+high)/2;        if (R[mid].key==k)      //查找成功返回            return mid+1;        if (R[mid].key>k)       //继续在R[low..mid-1]中查找            high=mid-1;        else            low=mid+1;          //继续在R[mid+1..high]中查找    }    return 0;}int main(){    int i,n=10;    int result;    SeqList R;    KeyType a[]= {12,18,24,35,47,50,62,83,90,115,134},x=47;    for (i=0; i<n; i++)        R[i].key=a[i];    result = BinSearch(R,n,x);    if(result>0)        printf("序列中第 %d 个是 %d\n",result, x);    else        printf("木有找到！\n");    return 0;}

（3）查找100

#include <stdio.h>#define MAXL 100typedef int KeyType;typedef char InfoType[10];typedef struct{    KeyType key;                //KeyType为关键字的数据类型    InfoType data;              //其他数据} NodeType;typedef NodeType SeqList[MAXL];     //顺序表类型int BinSearch(SeqList R,int n,KeyType k){    int low=0,high=n-1,mid;    while (low<=high)    {        mid=(low+high)/2;        if (R[mid].key==k)      //查找成功返回            return mid+1;        if (R[mid].key>k)       //继续在R[low..mid-1]中查找            high=mid-1;        else            low=mid+1;          //继续在R[mid+1..high]中查找    }    return 0;}int main(){    int i,n=10;    int result;    SeqList R;    KeyType a[]= {12,18,24,35,47,50,62,83,90,115,134},x=100;    for (i=0; i<n; i++)        R[i].key=a[i];    result = BinSearch(R,n,x);    if(result>0)        printf("序列中第 %d 个是 %d\n",result, x);    else        printf("木有找到！\n");    return 0;}

运行结果：

（1）查找90

（2）查找47

（3）查找100

阅读全文

0 0