资源列表
MergeSort
- 数据结构与算法分析设计的实验作业，归并排序的算法源代码
Stack
- 堆栈的初始化,判空,元素入栈,出站等基本操作以熟练掌握数据结构基本内容.-Stack initialization, contractors air,入栈elements, the basic operation of the station in order to master the basic content of the data structure.
niudunchazhi
- 数据结构，牛顿插值法。通过牛顿插值法求解方程-Data structure, Newton interpolation. Solving equations using the Newton interpolation
shiyansi
- 采用llink-rlink方式存储二叉排序树，编写能够通过键盘输入建立二叉排序树，并在建立完立即在屏幕显示中序遍历结果的程序。-Stored using llink-rlink binary sort tree, the preparation of the keyboard input through the establishment of binary sort tree, and build complete immediately display the results of the
cx
- 局部单元质量阵的子程序， 局部单元质量阵的子程序 -Local unit mass matrix of the subroutine, the subroutine local unit mass matrix, mass matrix of the local unit of the local unit of mass matrix of the subroutine subprogram
Warshall-Floyd
- floyd warshall algorithm
8empress
- 八皇后问题的回溯解法，每次显示一种方法，用户按下enter之后显示下一种解法-Retrospective method eight queens problem, each show a method is displayed after the user presses the enter of a solution under the
POJ3259--Wormholes(bellman)
- POJ3259--Wormholes,使用bellman方法。-POJ3259- Wormholes, use the bellman method.
First-order-binary-tree-traversal
- 二叉树先序遍历，二叉树先序遍历树种的各节点-First order binary tree traversal, preorder traversal of binary tree each node of tree species
prim
- 算法简介:Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O（|E|log|V|）-Introduction to Algorithms: Prim algorithm used to find the undire
1
- 使用VC++6.0打开WIS底层数据来实现相应功能-Using VC++6.0 open WIS the underlying data to achieve the corresponding functions
Kalman-filter
- 卡尔曼滤波算法，主要用于处理从加速度传感器和陀螺仪获得的数据，从而得到一个真实的角度。此算法可以用在四轴飞行器，自平衡小车等方面。-Kalman filtering algorithm, mainly for processing data obtained from the acceleration sensor and the gyro, to obtain a true perspective. This algorithm can be used in four-axis aircraf