qiaodxs的博客

#include<bits/stdc++.h>using namespace std;void menu(){ cout<<"请选择你需要的功能："<<endl; cout<<"1.插入排序"<<endl; cout<<"2.希尔排序"<<endl; cout<<"3.冒泡排序"<<endl; cout<<"4.快速排序"<<endl; cout<&l

#include<bits/stdc++.h>using namespace std;typedef struct BSTNode{ int data; BSTNode *lchild; BSTNode *rchild;}BSTNode, *BSTree; bool Search(BSTree bst, int k, BSTree f, BSTree *p){//查找成功时，p指向值为k的节点，查找失败时，则p指向遍历的最后一个节点 if(!bst){ *p = f

#include<bits/stdc++.h>using namespace std;typedef int VertexType;typedef int EdgeType;#define MAXSIZE 20#define MAXEDGE 20#define MAXVEX 20#define INF 0x3f3f3ftypedef struct{ VertexType vex[MAXVEX];//定点 EdgeType edg[MAXVEX][MAXVEX];//

#include<iostream>#include<cstring>using namespace std; #define OK 1#define ERROR 0#define SIZE 27typedef bool Status;typedef struct { char code; unsigned int weight; unsigned int parent,lchild,rchild;}HTNode,*HuffmanTree;typed

#include<iostream>#include<algorithm>#include<stack>#include<queue>#include<cstring>using namespace std;typedef char TElemType;typedef bool Status;typedef struct Tree{ TElemType Data; struct Tree * lchild, * rchil

#include<iostream>#include<algorithm>using namespace std;typedef int QElemType; typedef bool Status; typedef struct QNode{ QElemType data; struct QNode *next;}QNode, *QueuePtr;typedef struct { QueuePtr front; QueuePtr rear

#include<iostream>#include<algorithm>using namespace std;#define MaxSize 12500#define Col 30#define Row 30typedef bool Status; bool t[1250][1250];//标记，避免重复输入typedef struct{//稀疏矩阵三元表定义 int i, j; int e;}Triple;typedef struct{.

#include<iostream>#include<stdio.h>#include<stdlib.h>using namespace std;typedef int SElemType;typedef int Status;#define STACK_INIT_SIZE 100 #define INCREAMENT 10#define OVERFLOW -1typedef struct{ SElemType *base; SElemType

//双链表 #include<iostream>#include<stdio.h>#include<cstdlib>using namespace std;#define TRUE 1#define FALSE 0typedef int ElemType;typedef bool Status;typedef struct LNode{ struct LNode *next; struct LNode *pre; int data; }L

#include<stdio.h>#include<iostream>#include<cstdlib>using namespace std;#define List_init_size 100#define Listincreament 10#define ElemType int#define Status bool typedef struct{ ElemType *elem;//储存空间地址 int data;//节点数据 in