数据结构代码c.docx

1、数据结构代码c文件的操作：#include#includeint main() FILE*fp,*out,*in,*p; int i=0,a; fp=fopen(F:textintfile.dat,w); if(fp=NULL) printf(open the file error); exit(0); while(i1000) a=rand(); printf(%8d,a); fprintf(fp,%8d,a); i+; printf(n); fclose(fp); in=fopen(F:textintfile.dat,r); if(in=NULL) printf(open the file

2、 error); exit(0); while(!feof(in) fscanf(in, %8d,&a); fclose(in); out=fopen(F:textintfile.dat,r); if(out=NULL) printf(open the file error); exit(0); fseek(out,32L, SEEK_SET); fscanf(out,%8d,&a); printf(%8d,a); fseek(out,72L, SEEK_SET); fscanf(out,%8d,&a); printf(%8d,a); fseek(out,-40L, SEEK_END); fs

3、canf(out,%8d,&a); printf(%8d,a); fseek(out,-80L, SEEK_END); fscanf(out,%8d,&a); printf(%8d,a); system(pause); fclose(out); return 0;文件操作2：#include#includetypedef struct char name10;/ char num10;/ int sex; int grade3; STUDENT;STUDENT studinfo3;int main() FILE *in,*fp; int i,j; fp=fopen(F:textstudinfo

4、.dat,wb); if(fp=NULL) printf(open the file error); exit(0);printf(enter the information of students:n); for(i=0;i3;i+) scanf(%s,studinfoi.name); scanf(%s,studinfoi.num); scanf(%d,&studinfoi.sex); for(j=0;j3;j+) scanf(%d,&studinfoi.gradej);/ fwrite(studinfo,sizeof(STUDENT),3,fp); fclose(fp); in=fopen

5、(F:textstudinfo.dat,rb); if(in=NULL) printf(open the file error); exit(0); fread(studinfo,sizeof(STUDENT),3,in);/for(i=0;i3;i+) printf(%5s%5s,studinfoi.name,studinfoi.num); printf(%3d,studinfoi.sex); for(j=0;j3;j+) printf(%3d,studinfoi.gradej); printf(n); fclose(in); system(pause); return 0;排序：#incl

6、ude#include#define n 1000typedef struct int key;rectype;rectype Rn+1;void Bubblesort (rectype R) int i,j,swap; for(i=1;ii;j-) if(Rj-1.keyRj.key) R0=Rj-1; Rj-1=Rj; Rj=R0; swap=1; if(!swap) break; void Insertsort(rectype R) int i,j; for(i=2;i=n;i+) if (Ri.keyRi-1.key) R0=Ri; j=i-1; while(R0.keyRj.key)

7、 Rj+1=Rj-; Rj+1=R0; void Selectsort(rectype R,int s) /对R1Rn进行简单选择排序 int i,j,k; rectype t; for(i=1;in;i+) k=i; for(j=i+1;j=n;j+) /选择关键字最小的记录Rk if(Ri.keyRk.key) k=j; if(k!=i) t=Ri; Ri=Rk; Rk=t; int Partition(rectype R,int low,int high)/返回划分后被定位的基准记录的位置 rectype pivot=Rlow; while(lowhigh) while(low=pivo

8、t.key) high-; /自右向左扫描，查找第一个关键字大于R0.key的记录 if(lowhigh) Rlow+=Rhigh; /移动Rhigh至Rlow while(lowhigh&Rlow.key=pivot.key) low+; if(lowhigh) Rhigh-=Rlow; /移动 Rlow至Rhigh Rlow=pivot; return low; /快速排序void Quicksort(rectype R,int s,int t) int i; if(st)/只有一个记录或无记录时无需排序 i=Partition(R,s,t);/ 对Rs-Rt进行划分 Quicksort(

9、R,s,i-1)；/ Quicksort(R,s,i-1);/递归处理左序列 Quicksort(R,i+1,t);/递归处理右序列 int main() FILE *fp; int i=0,a; fp=fopen(F:/text/intfile,w); if(fp=NULL) printf(error); exit(0); while(in) a=rand(); printf(%10d,a); fprintf(fp,%10d,a); i+; printf(n); fclose(fp); fp=fopen(F:/text/intfile,r); if(fp=NULL) printf(error

10、); exit(0); for(i=1;i=n;i+) fscanf(fp,%10d,&Ri.key); printf(冒泡排序:n); Bubblesort (R); for(i=1;i=n;i+) printf(%10d,Ri.key); printf(n); printf(直接插入排序:n); Insertsort (R); for(i=1;i=n;i+) printf(%10d,Ri.key); printf(n); printf(简单选择排序:n); Selectsort (R,n); for(i=1;i=n;i+) printf(%10d,Ri.key); printf(n); p

11、rintf(快速排序:n); Quicksort (R,1,n); for(i=1;i=n;i+) printf(%10d,Ri.key); printf(n); fclose(fp); system(pause); return 0; 排序2#include#include#includetypedef struct char name10;/ char num10;/ int sex; int grade4; STUDENT;STUDENT studinfo4;int main() FILE *in,*fp; int i,j;int aver4;int k,swap; fp=fopen(F

12、:textstudinfo.dat,wb); if(fp=NULL) printf(open the file error); exit(0); printf(enter the information of students:n); for(i=1;i=3;i+) scanf(%s,studinfoi.name); scanf(%s,studinfoi.num); scanf(%d,&studinfoi.sex); for(j=1;j=3;j+) scanf(%d,&studinfoi.gradej);/ fwrite(studinfo,sizeof(STUDENT),3,fp); fclo

13、se(fp); in=fopen(F:textstudinfo.dat,rb); if(in=NULL) printf(open the file error); exit(0); fread(studinfo,sizeof(STUDENT),3,in);/ for(i=1;i=3;i+) printf(%5s%5s,studinfoi.name,studinfoi.num); printf(%3d,studinfoi.sex); for(j=1;j=3;j+) printf(%3d,studinfoi.gradej); printf(n); for(i=1;ii;j-) if(strcmp(

14、studinfoj-1.num,studinfoj.num)0) studinfo0=studinfoj-1; studinfoj-1=studinfoj; studinfoj=studinfo0; swap=1; if(!swap) break; printf(按学号排列后：n); for(i=1;i=3;i+) printf(%5s%5s,studinfoi.name,studinfoi.num); printf(%5d,studinfoi.sex); for(j=1;j=3;j+) printf(%5d,studinfoi.gradej); printf(n); printf(n); f

15、or(i=1;ii;j-) if(strcmp(studinfoj-1.name,studinfoj.name)0) studinfo0=studinfoj-1; studinfoj-1=studinfoj; studinfoj=studinfo0; swap=1; if(!swap) break; printf(按姓名排序后：n); for(i=1;i=3;i+) printf(%8s%8s,studinfoi.name,studinfoi.num); printf(%5d,studinfoi.sex); for(j=1;j=3;j+) printf(%10d,studinfoi.grade

16、j); printf(n); printf(n); printf(按平均成绩排序后：n); for(i=1;i=3;i+) averi=(studinfoi.grade1+studinfoi.grade2+studinfoi.grade3)/3; for(i=1;i=2;i+) if(averiaveri+1) studinfo0=studinfoi; studinfoi=studinfoi+1; studinfoi+1=studinfo0; for(i=1;i=3;i+) printf(%8s%8s,studinfoi.name,studinfoi.num); printf(%10d%10d

17、,studinfoi.sex,averi); for(j=1;j=3;j+) printf(%10d,studinfoi.gradej); printf(n); fclose(in); system(pause); return 0; 括号匹配#include#include#define Maxsize 100typedef struct char dataMaxsize; int top;SqStack;SqStack*InitList() SqStack*S=(SqStack*)malloc(sizeof(SqStack); S-top=0; return S; int correct(

18、char exp) char stMaxsize; int top=-1,i=0; int tag=1; while(expi!=0&tag) if(expi=(|expi=|expi=) top+; sttop=expi; if(expi=) if(sttop=() top-; else tag=0; if(expi=) if(sttop=) top-; else tag=0; if(expi=) if(sttop=) top-; else tag=0; i+; if(top!=-1)tag=0; if(tag=0)printf(no); else printf(yes);int main(

19、) SqStack*S; int correct(char exp); char n,expMaxsize; printf(输入表达式：n); gets(exp); correct(exp); system(pause); return 0;后缀表示法#include#include#include#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define N 100typedef struct int *base; int *top; int stacksize;SqStack;void InitStack (SqStack &S)

20、 /构造一个空栈S S.base =(int *)malloc(STACK_INIT_SIZE * sizeof(int); if(!S.base)exit(0); S.top =S.base; S.stacksize=STACK_INIT_SIZE; /InitStackvoid Push(SqStack &S,int e) /插入元素e为新的栈顶元素 if(S.top-S.base=S.stacksize) S.base=(int *)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(int); if(!S.base)exit(0); S

21、.top=S.base+S.stacksize; S.stacksize+=STACKINCREMENT; *S.top+=e; void Pop(SqStack &S, int *e) /若栈不空，则删除S的栈顶元素，用e返回其值 if(S.base=S.top)return; *e=*-S.top; int main() char aN; char pN; int i,j,q; int c,b,d; SqStack S; InitStack(S); gets(a); for(i=0;ai!=0;i+) j=0; while(ai!= ) pj=ai; i+; j+; if(p0!=+)&(

22、p0!=-)&(p0!=*)&(p0!=/) q=atoi(p); Push(S,q); else Pop(S,&c); Pop(S,&b); switch(p0) case+: d=b+c;break; case-: d=b-c;break; case*: d=b*c;break; case/: d=b/c;break; default: printf(hehe); Push(S,d); memset(p,0,N); Pop(S,&d); printf(n答案为：%dn,d); system(pause); return 0;邻接矩阵的深度遍历：#include#include#define

23、 n 8#define e 10/图的边数 int visitedn;typedef int vextype;/顶点的数据结构 typedef int adjtype;/顶点权值数据结构typedef struct vextype vexn; adjtype arcnn;/邻接矩阵 graph;graph G;void CreateAdjArray(graph *G)/建立无向网络邻接矩阵 int i,j,k; for(i=1;ivexi=i; for(i=1;i=n;i+) for(j=1;jarcij=0; for(k=1;karcij=1; void DFSTraverse(graph

24、*G,int i) /深度遍历搜索 printf(深度优先遍历:顶点%dn, G-vexi); visitedi=1; for(int j=1;jarcij=1 & visitedj=0) DFSTraverse(G,j); void DFSA(graph* G) int i; for(i=1;i=n;i+) visitedi=0; for(i=1;i=n;i+) if(!visitedi) DFSTraverse(G,i);/DFSA int main() int i; graph *G=(graph *)malloc(sizeof(graph); CreateAdjArray(G); printf(input graph G：n); DFSA(