源代码参考

实验一：源代码参考：程序如下：#include <stdio.h>#include <stdlib.h>/*顺序表的定义：*/#define ListSize 100typedef struct{ int data[ListSize]; /*向量data用于存放表结点*/ int length; /*当前的表长度*/}SeqList;void main(){ void CreateList(SeqList *L,int n);void PrintList(SeqList *L,int n);int LocateList(SeqList *L,int x);void InsertList(SeqList *L,int x,int i);void DeleteList(SeqList *L,int i);SeqList L;int i,x;int n=10; /*THE LENGTH OF LIST*/L.length=0;clrscr();CreateList(&L,n); /*CREAT THE LIST*/PrintList(&L,n); /*PRINT THE LIST*/printf("INPUT THE RESEARCH ELEMENT");scanf("%d",&x);i=LocateList(&L,x);printf("the research position is %d\n",i); /*顺序表查找*/ printf("input the position of insert:\n");scanf("%d",&i);printf("input the value of insert\n");scanf("%d",&x);InsertList(&L,x,i); /*顺序表插入*/PrintList(&L,n); /*打印顺序表*/printf("input the position of delete\n");scanf("%d",&i);DeleteList(&L,i); /*顺序表删除*/PrintList(&L,n);getch();/*打印顺序表*/}/*顺序表的建立：*/void CreateList(SeqList *L,int n){int i;printf("please input n numbers\n");for(i=1;i<=n;i++){scanf("%d",&L->data[i]);}L->length=n;}/*顺序表的打印：*/void PrintList(SeqList *L,int n){int i;printf("the sqlist is\n");for(i=1;i<=n;i++)printf("%d ",L->data[i]);}/*顺序表的查找：*/int LocateList(SeqList *L,int x) {int i;for(i=1;i<=10;i++)if((L->data[i])==x) return(i);else return(0);}/*顺序表的插入：*/void InsertList(SeqList *L,int x,int i) {int j;for(j=L->length;j>=i;j--)L->data[j+1]=L->data[j];L->data[i]=x;L->length++;}/*顺序表的删除：*/void DeleteList(SeqList *L,int i){ int j;for(j=i;j<=(L->length)-1;j++)L->data[j]=L->data[j+1];}实验二源代码参考#include "stdio.h"#include "conio.h"#define MaxSize 100 /*栈中的元素的最大个数*/ typedef int ElemType;typedef struct{ElemType data[MaxSize];/*存放堆栈的数组*/int top;/*栈顶元素*/}Stack,*S;/*堆栈的初始化*/void InitStack(Stack *S){/*指向的是最顶端的元素取值范围为从0~MaxSize-1为-1时说明为空栈*/S->top=-1;}/*判栈空操作*/int StackEmpty(Stack *S){return (S->top==-1?1:0);}/*压栈操作*/void Push(Stack *S,ElemType x){int i ;if (S->top==MaxSize-1){printf("Stack is full");exit(1);}/*else S->data[++S->top]=x; */else{S->top = S->top+1;i = S->top;S->data[i] = x;}}/*出栈操作*/int Pop(Stack *S){int i;if(StackEmpty(S)){printf("\n Stack is free!");return 0;}else{i=S->data[S->top];S->top--;return i;}}/*栈长度操作*/int GetLength(Stack *S){return S->top+1;}/*取栈顶操作*/int GetTop(Stack *S){if(StackEmpty(S)){printf("\nStack is free");return 0;}else{if(GetLength(S))return 0;elsereturn S->data[S->top]; }}main(){Stack *S;int i,j,e,result;InitStack(S);for(i=1;i<=2;i++){scanf("%d",&e);Push(S,e);}printf("The number of elem is :%d",GetLength(S));e = Pop(S);printf("\nAfter a pop ,The number of elem is :%d",GetLength(S));printf("\n%d",e);for(i =0; i<10 ; i++)printf("\n%d",GetTop(S));getch();}实验三源代码参考. #include <stdio.h>#include <string.h>/*得到数组的长度*/int strLen(char *s){int i = 0;while(s[i]!='\0'){i ++;}return i ;}/*简单模式匹配算法*/int Index(char *S,char *T,int pos){/*存放比较的总次数*/int times = 0;int i = pos-1, j = 0;int sLen = strLen(S);int tLen = strLen(T);while(i<sLen && j<tLen){times ++;if(S[i]==T[j]) {i++; j++;} /* 继续比较后续字符*/else {i = i-j+1; j=0;} /* 指针后退重新比较*/ }printf("the times that compares are %d\n",times);if( j >= tLen ){return i-tLen+1;}else return 0;}实验四源代码参考# define bitreptr struct type1 /*二叉树及其先序边历*/ # define null 0# define len sizeof(bitreptr)bitreptr *bt;int f,g;bitreptr /*二叉树结点类型说明*/{char data;bitreptr *lchild,*rchild;};preorder(bitreptr *bt) /*先序遍历二叉树*/{if(g==1) printf("先序遍历序列为：\n");g=g+1;if(bt){printf("%6c",bt->data);preorder(bt->lchild);preorder(bt->rchild);}else if(g==2) printf("空树\n");}bitreptr *crt_bt() /*建立二叉树*/{bitreptr *bt;char ch;if(f==1) printf("输入根结点，#表示结束\n"); else printf("输入结点，#表示结束\n");scanf("\n%c",&ch);f=f+1;if(ch=='#') bt=null;else{bt=(bitreptr *)malloc(len);bt->data=ch;printf("%c 左孩子",bt->data);bt->lchild=crt_bt();printf("%c 右孩子",bt->data);bt->rchild=crt_bt();}return(bt);}main(){f=1;g=1;bt=crt_bt();preorder(bt);}。