数据结构顺序表(电话通讯录)

数据结构用顺序表实现的电话通讯录（C语言）

#include<>

#include<>

#include<>

#include<>

#define FALSE 0

#define ERROR 0

#define OK 1

#define INFEASIBLE -1

#define LIST_INIT_SIZE 10

#define LIST_INCREMENT 5

#define N 5

typedef int Status;

typedef struct

{ char name[10]; 导入记录 *\n");

p rintf("\t\t * 2. 输入记录 *\n");

p rintf("\t\t * 3. 删除记录 *\n");

p rintf("\t\t * 4. 显示所有记录 *\n");

p rintf("\t\t * 0. 返回本菜单 *\n");

p rintf("\t\t *************************************\n\n\n"); }

//开始函数

void start()

{

printf("\n");

printf("\t\t\t**************************\n");

printf("\t\t\t* 欢迎使用 *\n");

printf("\t\t\t* 电话查询系统 *\n");

printf("\t\t\t**************************\n");

printf("\t\t\t* *\n");

printf("\t\t\t**************************\n");

printf("\n");

m enu();

}

int main()

{

i nt i=0,j;

s tudent e;

S qlist p,q;

InitList(L);

s tart();

w hile(scanf("%d",&i))

{

switch(i)

{

case 1: stuIntsertList(L); break;

case 2: ScanIn(L);break;

case 3: Delete(L);break;

case 4: ListTraverse(L,print);break;

case 0: menu();break;

default:wrong();

}

}

r eturn 0;

}