资源列表
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)
search
- 这是基于C++语言关于一个图形中简单路径的数量的计算方法(This is based on the C ++ language about the number of simple paths in a graph)
多项式
- 符号处理是一类非数值性问题,一元多项式就是符号处理的一类实例。一个一元n次多项式的一般形式如下: Pn(x)=p1xe1+p2xe2+…+pmxem 其中 p1,p2,…, pm为各项的系数,非零; e1,e2,…, em 为各项的指数,满足0?e1 ?e2 ?... ?em 现要求在计算机中存储这样的多项式,并能对它们进行处理,如:加法、减法、乘法等等。(The operation, representation, input, etc of a polynomial)
运算器
- 设计实现一个简单的计算器,可以接受中缀数值表达式,并进行求值。 至少应该包括加、减、乘、除4种运算和括号处理; (2) 运算量可以自己约束(整数、实数等); (3)有能力的同学可以仿照WINDOWS计算器界面(The design and implementation of a simple calculator, can accept infix numerical expression, and evaluation. At least 4 additional operations,