资源列表
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题，这是我编的一个小程序，运行过很好。-greedy algorithm can be used to solve a very good 0 / 1 knapsack problem, this is my part of a small program running very good.
RLS
- 递归最小算法的一种改进算法，性能有很大的改进。
erchapaixushu
- 二叉排序树的实现，用C++语言实现的算法，希望那个能给大家一点帮助
循环单链表基本算法实现
- 循环单链表基本算法实现，如初始化，尾插法，输出，插入，删除等-Circulation single linked list of basic algorithms, such as initialization, the end of interpolation, output, insert, delete, etc.
Sort
- 对一组数据进行直接插入排序、冒泡排序、简单选择排序和快速排序。（升序）-Of a set of data for direct insertion sort, bubble sort, simple selection sort and quicksort. (Ascending)
tuxinglinjiedianshuzushixian
- 数据结构图的实现方法：数组表示法，给出代码，帮助加深对数据结构的理解和实现-Data structure of the realization of methods: an array of expression, given the code to help deepen the understanding of the data structure and the realization of
utf8ToUcs2-ucs2ToUtf8
- 实现utf8到Ucs2的编码转换 和ucs2到Utf8的编码转换-To achieve the Ucs2 encoding utf8 conversion and ucs2 to Utf8 transcoding
abababmarkov
- 自己写的一个马尔科夫转移状态的求解程序，对于学习马尔科夫决策的人或许有用-To write a Markov transition state solver for learning Markov Decision person may be useful
multiplication
- 要求采用链表形式，求两个一元多项式的乘积：h3 = h1*h2。函数原型为：void multiplication( NODE * h1, NODE * h2, NODE * h3 )。-Require the use of a linked list, find the product of two one yuan polynomial: h3 = h1* h2. Function prototype: void multiplication (NODE* h1, NODE* h2, NOD
higher-order
- 这是一种高阶滑模的船舶姿态控制方法，经过此程序可以实现船舶航行时的姿态控制。-a kind of higher-order sliding mode controller design for ship attitide control
gmm
- Clustering of data points using Gaussian Mixture Model and EM Algorithm
复杂应力状态求解
- 三向应力状态matalb求解，求得主剪切应力