资源列表
备课
- 数据结构实验 算术表达式求值 算术匹配 顺序表等(Data structure experiment, arithmetic expression evaluation, arithmetic matching, order table, etc.)
Josephus问题：一个热土豆引发的故事
- 数据结构编程实验：Josephus问题：一个热土豆引发的故事(Data Structure Experiment: Josephus question: the story of a hot potato)
击鼓传花游戏还可以这样玩
- 数据结构编程实验：击鼓传花游戏还可以这样玩(Data Structure experiment: Beat the drum, the game can also play like this.)
eng
- 识别图片中英文数字，或者验证码用的字典。(A dictionary used to recognize pictures in English, numerals, or verification codes.)
排序算法
- 冒泡排序、快速排序、希尔排序、堆排序等等常用的排序算法。C/C++实现(Bubble sort, quick sort, Hill sort, heap sort, and so on, commonly used sorting algorithm. C/C++ implementation)
基于Kalman滤波的神经网络快速学习算法及应用
- 一篇关于kalman滤波器论文，非常值得学习(a paper about kalman algrithom)
MST-kruskal
- The classic kruskal algorithm is implemented Import: adjacency matrix Output: Minimum spanning tree
biTree
- ? 按先序遍历的扩展序列建立二叉树的二叉链表存储结构，实现二叉树先序、中序、后序遍历的递归算法，实现二叉树中序遍历的非递归算法，实现二叉树层次遍历的非递归算法（要求使用顺序队列，调用顺序队列基本操作实现），求二叉树的深度(后序遍历)。(Two binary linked list storage structure - first traversal of the extended sequence according to the establishment of the two fork t
Bindnary Tree
- C++实现数据结构中二叉树的ADT 可实现创建 求最小二叉树等等功能(C++ data structure to achieve the two fork tree ADT, you can create, seek the minimum two fork tree, and so on)
delete
- 删除数组中小于某个特定值的所有函数，或删除大于某个特定值的所有函数，或删除某一指定范围内的所有元素，用二叉树实现(Delete all functions in the array that are less than a particular value, or delete all functions that are larger than a particular value, or delete all elements within a specified range, with a
tree
- 输入任意树并存储，实现前序、中序、后序遍历(Enter any tree and store, to achieve pre-order, in order, after the sequence traversal)
binarySearchTree
- 这是基于C++语言的关于二叉查找树的删除、插入、查找的功能实现(Delete, insert, find of the binary tree)