VAEaaaa的博客

运行结果源文件#include"堆排序的堆栈.h"//简单排序法//在startIndex至表尾范围内找到最小关键字的下标元素int FindMin(List list, int startIndex){ int i, minIndex = startIndex; for (i = startIndex+1; i < list.n; i++) { if (list.D[i].key < list.D[minIndex].key) { minIndex =

运行结果：源文件：#include "邻接表宽度优先遍历的queue.h"//邻接表的初始化Status Init(LGraph* lg, int nSize){ int i; lg->numofDot = nSize; lg->numofEdge = 0; lg->a = (ENode**)malloc(nSize * sizeof(ENode*)); if (!lg->a) { return ERROR; } else { for (i =

运行结果：源文件：#include "邻接矩阵宽度优先遍历的queue.h"//邻接矩阵的初始化Status Init(MGraph* mg, int nSize, ElemType noEdgeValue){ int i, j; mg->numofDot = nSize; mg->numofEdg = 0; mg->noEdge = noEdgeValue; mg->a = (ElemType**)malloc(nSize * sizeof(ElemType

我们学校实验之一，对你有用可自提#include<stdio.h>#include<stdlib.h>#include<string.h>#define ERROR 0#define OK 1#define Overflow 2#define Underflow 3#define NotProsent 4#define Duplicate 5typedef int ElemType;typedef struct seqList{ int n;

有需求者可自提#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct Node { int coef; int exp; struct Node* next;}Node,*LinkList;typedef struct Head { LinkList head;}Head;void Insert(LinkList Head, int coef, int exp) //

有需求者可自提代码#include<stdio.h>#include<stdlib.h>#include<string.h>#define ERROR 0#define OK 1#define Overflow 2#define Underflow 3#define NotProsent 4#define Duplicate 5typedef int ElemType;typedef struct seqList{ int n; int ma

效果图如下下面为内容：源文件：#include "层次遍历的Queue.h"#include "非递归算法的堆栈.h"void Create(BinaryTree* bt) //构造一棵空的二叉树{ bt->root = NULL;}BTNode* NewNode(ElemType x, BTNode* ln, BTNode* rn) //创造一个新的节点{ BTNode* p = (BTNode*)malloc(sizeof(BTNode)); p->e

源文件：#include "优先权队列.h"#include "哈夫曼的stack.h"//构造一棵空的二叉树void Create(BinaryTree* bt) { bt->root = NULL;}HFMTNode* NewBTNode(ElemType w, HFMTNode* lC, HFMTNode* rC){ HFMTNode* p = (HFMTNode*)malloc(sizeof(HFMTNode)); p->w = w; p->lChil

第一问：#include<iostream>#include<string>using namespace std;class BookCard{private: string id; string stuName; int number;public: BookCard(string i,string s,int n); BookCard(const BookCard & per); BookCard(); void dispaly(); bo

#include<iostream>using namespace std;const double PI = 3.14156;class Container{protected: double radius;public: Container(double r) { radius = r; } virtual double area() = 0; virtual double volume() = 0; virtual void print() = 0;};c

南邮c++实验 文件中选课和选课人数问题 代码#include<fstream>#include<iostream>#include<string>#include<iomanip>using namespace std;class Course{ string name; int number;public: Course(string na = "", int num = 0); friend ostream& operat

南邮c++实验工资管理问题 代码#include<iostream>#include<string>using namespace std;class Employee{protected: string name; //姓名 int working_years; //工龄public: Employee(string nm = "unnamed", int wy = 0); string Getname(); double ComputePay();

c++车类继承问题#include<iostream>#include<string>using namespace std;class Vehicle{protected: int MaxSpeed; int Weight;public: Vehicle(int m, int w) { MaxSpeed = m; Weight = w; cout << "Constructing Vehicle...\n"; } ~Vehicle