x13804709的博客

//struct node //{ // datatype info; // node *next; // node() :next(NULL) {} // node(datatype x) :info(x), next(NULL) {} //}; class node //结点类 { public: node(); node(datatype x) { info = x; next

class tree { public: tree(); ~tree(); datatype info; tree *lchild; tree *rchild; private: }; tree::tree() { rchild = NULL; lchild = NULL; } tree::~tree() { } class treelink { public: treeli

邻接表的c++ #define maxSize 5 #define INFINITY 10000 //代表无穷 typedef char Vertex;//节点类型 typedef int edge;//边上权值类型 //边节点 class edgeNode { public: edgeNode(); ~edgeNode(); int adjvex; edge weigh

设置标兵，将小于和大于标兵的数分别放在标兵两侧。进行递归。 void quickSort(Student s[], int low, int high) { Student temp; temp = s[low]; if (low < high) { int i = low, j = high; while (i < j) { while (i < ...