The_RedMaple的博客

考研408 高数，专业课思维导图

#include <stdio.h> #include <time.h> #include <stdlib.h> #define MAXSIZE 8000 typedef struct //创建顺序表，count用于记录查找次数 { int data[MAXSIZE]; int count=0; }SqList; void Bubble_Sort(SqList *&L,int i) //实现快速排序 { int temp; fo

#include <stdio.h> #include <stdlib.h> #include <time.h> #include "btree.h" #define COUNT 20 void CreateBTree(BTNode *&b,char *str) //接收一个符号表示法的二叉树字符串，创建为一个二叉树结构 { BTNode *St[MAXSIZE],*p; int top = -1,k,j=0; char ch; b = NULL;

#include <stdio.h> #include <malloc.h> #define MAXSIZE 30 typedef struct { char data[MAXSIZE]; int len; }SqString; void StrAssign(SqString &S,char a[]) { int i; for(i=0; a[i]!='\0'; i++) { S.data[i] = a[i]; } S.len = .

#include <stdio.h> #include <malloc.h> typedef struct LNode { int data; struct LNode *next; //指向后继元素; } LinkNode; void CreateList(LinkNode *&L,int a[],int n) { LinkNode *s; L = (LinkNode*)malloc(sizeof(LinkNode)); L->n

#include <stdio.h> #include<malloc.h> typedef struct { int data[10]; int length; }SqList; void CreateList(SqList *&L,int a[],int n) { int i=0,k=0; L= (SqList*)malloc(sizeof(SqList)); while(i<n) { L->data[k]=a[i]; k