资源列表
circ-queue
- An example that demonstate using a circular queue class.
dynamic-programming
- 动态规划算法，包括最长公共子序列、矩阵链相乘、FLOYD、背包算法等。-Dynamic programming algorithm, including the maxinum common sub sequence, matrix chain multiplication, FLOYD, knapsack algorithm, etc..
Application-Stack
- 用算符优先法对算术表达式求值， 以字符序列的形式从终端输入语法正确的、不含变量的整数表达式-Integer expression with operator precedence arithmetic expression is uated in the form of a sequence of characters the input terminal grammatically correct, variable-free
Traversing-the-node-tree
- 该程序以二叉链表作为存储结构，遍历树中所有结点-The program to the list as a binary storage structure, all nodes in the tree traversal
bplustree
- c语言实现的B+树，数据都在内存中，实现了插入和删除-bplustree in c
milkrun
- 使用深度优先搜索结合Floyd算法对循环取货问题进行穷举。-Using the depth-first search algorithm combined with Floyd circulation problems pickup exhaustive.
yiqunyouhuasuanfa
- 蚁群算法的优化，以改善传统的蚁群算法不适用欲大规划的TSP问题的解决，缩短搜索的时间。-Ant colony optimization algorithm to improve the traditional ant colony algorithm NA For big plan to solve TSP problem, shorten the time of the search.
ClimbLadder
- 分别使用动态规划思想和非动态规划思想完成爬梯子问题（一次爬一步或者两步）-Using dynamic programming and non-dynamic programming to complete the problem of climbing a ladder (one-step or two-step a time)
MaxContinueArraySum
- 最大连续数组和，求解数组中子连续数组中最大的和-Maximum continuous array and solve the largest and contiguous array
QuickSort
- 快速排序，使用数组和指针两种方式完成快速排序算法-Quick sort, to use the two ways ofarrays and pointers completes the quick sort algorithm
FixedSum
- 利用Hash查找的方式，寻找int数组中元素之和为固定和-Find a way to make use of Hash, looking int elements of the array and fixed and
firtest2015.2
- vivado fir 测试工程,dds chansheng shuju ranhou gei fir -vivado fir