Duke10的博客

#include <stdio.h>#include <stdlib.h>#define MAXSIZE 20//二叉树结点的结构体表示形式typedef struct BitNode{ char data; struct BitNode* left,*right;}BitTree;//栈的结构体表示形式typedef struct stackelem{

VC6.0下写的：#include<stdio.h>#include<stdlib.h>#define MAXSIZE 100typedef char datatype;typedef struct{ datatype *base; //存储空间的基地址 int front; //记录队头的下标 int rear; //记录队尾下一个位

#include<stdio.h>#include<stdlib.h>//二叉树结点定义typedef struct BT{ char data; struct BT *lchild; struct BT *rchild;}BT;//建立二叉树（前序创建）BT *createtree(){ BT *bt; char x; scanf("%c

#include<stdio.h>#include<stdlib.h>//栈结点的定义typedef struct stacknode{ char data; struct stacknode *next;}stacknode;//构造空栈stacknode* creat_stack(){ stacknode *top = NULL; return top

#include<stdio.h>#include<stdlib.h>#define true 1#define false 0int s = 0; //定义全局变量s接收查找数据的位置//结点类型定义typedef struct linknode{ char data; struct linknode *next;}Node;//构造链表（带头结点的尾插法建表

库函数调用快速排序：--------------------------------------------------------------------------------#include<stdio.h>#include<stdlib.h>int sort(const void *a, const void *b){ return *(int *)a - *(int *)

把一个数插入到已经排好序的数组中去：--------------------------------------------------------------------------------// 二分插入排序#include<stdio.h>#include<stdlib.h>int sort(const void *a, const void *b){ return *(

#include<stdio.h>void mergearray(int a[], int first, int mid, int last,int temp[]){ int i = first, j = mid + 1; int m = mid, n = last; int k = 0; while (i <= m && j <= n) {

include <stdio.h>//array是待调整的堆数组，i是待调整的数组元素的位置，nlength是数组的长度//本函数功能是：根据数组array构建大根堆void HeapAdjust(int array[],int i,int nLength){ int nChild; int nTemp; for(;2*i+1<nLength;i=nChild)

#include&lt;stdio.h&gt;int main(){ int a[10] = {49, 38, 65, 97, 26, 13, 27, 49, 55, 4}; int i, j, gap, n = 10; for (gap = n / 2; gap &gt; 0; gap /= 2) { for (j = gap; j &lt; n; j++)//从数组第

//顺序栈的定义和基本算法#include<stdio.h>#include<stdlib.h>#define stacksize 100typedef char datatype;//定义顺序栈typedef struct{ datatype data[stacksize]; int top;}seqstack;//置空栈seqstack *initstack(se

#include<stdio.h>#include<stdlib.h>typedef char datatype;typedef struct BitNode{ datatype data; struct BitNode *lchild, *rchild;}BT;char sh = '0'; //判断是否为根结点BT *create_tree(){ BT *b