资源列表
哈夫曼树和编码include
- 学习了解哈夫曼树和编码，更好到学算法与数据结构(Learn Huffman tree and coding, better to learn algorithm and data structure)
liste-double
- Liste doublement chainee
期中project
- 可以自己创建家谱，进行插入，删除，查询等功能(You can create your own family tree, insert, delete, query and other functions)
利用栈进行括号匹配检验
- 检验一条信息中括号各个匹配与否。比如输入（）{}会提示错误，输入（{}）会提示正确。 另外附录了线性表基本操作的对应代码(Check whether parentheses match each other in a message. In addition, the corresponding code of the basic operation of the linear table is attached)
graph
- Implementation of Graph Data Structure in C++
遍历二叉树
- 简单的二叉树通过递归算法遍历，先序遍历中序遍历和后序遍历。通过遍历对二叉树的结构有更深入的学习(Simple two tree traversal through recursive algorithm, first order traversal traversal and preorder traversal. Through traversal, the structure of the two fork tree has a more in-depth study)
binary tree
- 二叉树的创建和非递归遍历,包括先序遍历，中序遍历，后序遍历(the creation and non-recursive traversal of binary tree)
mastering algoritnm with c examples
- mastering algorithm with c examples
interpolation-master
- github上找到的线性插值、抛物线插值、双曲线插值算法源码
猴子选大王
- 猴子选大王，有N只猴子，从1～N进行编号。它们按照编号的顺时针方向，排成一个圆圈，然后从第一只猴子开始报数。第一只猴子报1，以后每只猴子报的数字都是它前面猴子所报数字加1。如果一只猴子报的数字是M，则该猴子出列，下一只猴子重新从1开始报数。剩下的猴子继续排成一个圆圈报数，直到全部的猴子都出列为止。最后一个出列的猴子胜出。按照上述规则，编写程序选出排成一圈的猴子中的大王。(Monkey King, N monkeys, numbered from 1 to N. They are in accor
实验(1)
- 数据结构实验一，模仿打印机，排队等候，输出结果(data program Data structure experiment First, imitate the printer, wait in line, output the result)
qsort
- 一个小小的c++程序，可以实现快速排序，比较简单(A small c++ program that can achieve quick sorts, relatively simple,good luck)