数据结构之顺序查找表

来源：互联网发布：苏州淘宝代运营公司编辑：程序博客网时间：2024/05/22 12:55

#include<iostream>#include<stdlib.h>#include<malloc.h>using namespace std;#define ElemType int#define TABLESIZE 10typedef struct{ElemType *pBase;int length;}SSTable;void InitTable(SSTable &ST){ST.pBase = (ElemType *)malloc(TABLESIZE*sizeof(ElemType));ST.length = 0;return;}void CreateTable(SSTable &ST, int count){cout << "请输入" << count << "个元素的值:" << endl;for (int i =1; i<=count; ++i)cin >> ST.pBase[i];ST.length = count;return;}int SearchTable(SSTable ST, ElemType e){int pos;ST.pBase[0] = e; //入哨for (pos = ST.length; ST.pBase[pos] != e; pos--);return pos;}int main(void){SSTable ST;InitTable(ST);CreateTable(ST, 6);int i = SearchTable(ST, 5);if (i){cout << "查找成功!" << endl;cout << "查找元素所在的位置是:" << i << endl;cout << "查找到的元素为:" << ST.pBase[i] << endl;}elsecout << "查找失败!" << endl;return(0);}

<img src="http://img.blog.csdn.net/20140929194723280?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvaGdldGVybmFs/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />

0 0