heapSort.cpp.tar

A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)

数据结构计算算术表达式算法，可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)

说明：  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)

迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)

数据结构上机操作实验的实验1，线性表的基本操作！！！(the basic operation of sq of date structure)

大二时做的一个数据结构的课程设计，用2-3树实现的图书馆管理系统，只是控制台程序，没有很好的图形界面。包括管理员、读者。管理员功能有：采编入库、查看图书、查看读者、删除读者。读者功能有：借书、还书、预约、查找等等。。功能全面。包括注册账号，登录需要账号密码。(Sophomore to do a data structure of the curriculum design, with 2-3 tree implementation of library management system, but the console program, not a good graphical interface. Including administrators, readers. Administrator functions include: editing storage, check books, check readers, delete readers. Reader functions: library, book, booking, search and so on. . Full-featured. Including the registration account, login account password required. )

poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)

参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写，很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)

建立链表的算法： 新节点链入表尾建立链表： 动态分配第一个节点变量； 用指针head 妥善保存链表第一个节点的地址值； 依次动态分配一个新节点变量； 将上一个节点的指针域指向新生成的节点； 循环3),4)步骤，直到所有节点均连入链表； 将最后一个节点的指针域赋值为0； (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )

中国大学MOOC-陈越、何钦铭-数据结构 解题报告—06-3 六度空间 (Chinese University MOOC- Chen Yue, He Qinming- data structure Solving report of the problem- 06-3 Six degrees space)