spider_max的博客

#include<stdio.h>#include<stdlib.h>#define maxsize 1024#define null NULLtypedef struct list{ int data[maxsize]; int last;}list;list * init_list(){ list *L; L= (list ...

#include<stdio.h>#include<stdlib.h>#define NULL 0// typedef struct stu_node{// char cno[10];// char cname[10];// int iscore[4];// }elemtype;typedef int elemtype;type...

#include<stdio.h> //栈完成#include<malloc.h>#include<stdlib.h>#include<stdbool.h>typedef struct node{ //定义节点 int data; struct node *pnext;}NODE,*PNODE;typedef struc...

#include<stdio.h> //循环队列完成#include<malloc.h>#include<stdlib.h>#include<stdbool.h>typedef struct Queue{ int *pBase; //代表数组的首地址 int front;//代表的数组的下标 int rear;}Q...

#include <stdio.h> //链式二叉树递归遍历完成#include <malloc.h>#include <stdlib.h>#include <stdbool.h>typedef struct BTNode{ int data; struct BTNode *pLchild; //左孩子 struc...

#include<stdio.h> //快速排序完成void QuickSort(int [],int,int);int FindPos(int *a,int,int);int main(void){ int i; int a[6] ={2,1,2000,99,4,3}; QuickSort(a,0,5); for(i=0;i<6;i++...