顺序表的查找完整实现代码

#include

#include

#include

#include

using namespace std;

#define EQ(a,b) ((a) == (b))

#define LT(a,b) ((a) < (b) )

#define LE(a,b) ((a) <= (b))

typedef int keyType;

typedef struct {

int key;

float info;

}sTable;

int seq_search(sTable ST[],int n,int key)

{

ST[0].key = key;

int i = n;

while(ST[i].key!=key)

i--;

return i;

}

struct node{

int key;

struct node *next;

};

int list_search(struct node *ST,int key)

{

struct node *m = ST;

while(m->next!=NULL&&m->key!=key) m = m->next;

return m->key;

}

typedef struct {

int key;

int math;

int english;

}elemType;

typedef struct {

elemType *elem;

int length;

}STable;

int ST_search(STable ST,int key)

{

ST.elem[0].key = key;

int i =ST.length;

for(;!(EQ(key,ST.elem[i].key));i--);

return i;

}

// er fen czhao

int bin_search(STable ST,int key)

{

int low,high,mid;

ST.elem[0].key = key;

low = 1;

high = ST.length;

while(low<=high){

mid = (low+high)/2;

if(ST.elem[mid].key == key)

return mid;

else if(ST.elem[mid].key

low = mid+1;

else

high = mid-1;

}

return 0;

}

void getData(STable *t)

{

char *fp = ".\\stu.dat";

int i=1;

fstream ff(fp,ios::in|ios::trunc);

ff.read((char *)&(t->length),4);

while(i<=t->length){

ff.read((char *)&(t->elem[i].key),4);

ff.read((char *)&(t->elem[i].math),4);

ff.read((char *)&(t->elem[i].english),4);

i++;

}

ff.close();

}

void main()

{

cout<

cout<<"cout the test"<

elemType stu[50];

STable ST;

ST.length = 10;

char *fp = ".\\stu.dat";

fstream fa(fp,ios::out|ios::trunc);

int i =1;

fa.write((char *)&ST.length,4);

while(i<=ST.length){

stu[i].key = 1000+i;

stu[i].math = rand()%100;

stu[i].english = rand()%100;

fa.write((char *)&ST.elem[i],12);

i++;

}

fa.close();

int j,k;

ST.elem = stu;

getData(&ST);

cout<<"class people is "<

cout<<"cin the k"<

cin>>k;

i = ST_search(ST,k);

j = bin_search(ST,k);

cout<<"i "<

}