资源列表
hh
- debug 码字-debug code word
uui
- 简单的DOS命令 ping，arp等，无聊时候做的-Simple DOS command ping, arp, etc. do when bored. . .
lcs
- Longest Common Subsequence Problem. Solution both Iterative and Recursive.
Ad_ascii_179-220
- Show extended ASCii characters 0-255 in console window
PiSolution
- 多核架构编程：利用临界区多线程并行求PI值 只有C++文件 多核作业-Multicore programming: the use of the critical region is multi-threaded parallel seek the value of PI C++ file
binary-tree
- 建立了一个二叉树，写出二叉树的结点，然后用前序历遍、中序历遍、后序历遍来访问了整棵二叉树。-A binary tree, write a binary tree node, and then use the pre-order the calendar over the calendar times in sequence, after the sequence to access the calendar over the whole grain binary tree.
juzhenhanglieshi
- 可以从txt中读入矩阵，按行按列展开矩阵，以此求出矩阵的行列式-Can be read from txt into the matrix, expand the matrix row by row, in order to find the matrix determinant
interation
- 用面积累加的方法求解积分函数的结果，可以自由的输入积分上下限，以及分割段数-The results accumulated by the area method for solving integral function, you can enter upper and lower limits of freedom points, and the number of divided segments
p1-60
- 链表，递归结构，结构指针变量，将链表数据从尾到头打印出来-List, recursive structure, the structure pointer variable, data the end of the list printed Daotou
SketchPad
- SketchPad is a sample of an html 5 sketchpas with save to image
case32
- 2. 对于一个给定的n*m的矩阵，矩阵中的每个元素aij均为非负整数。游戏规则如下： 1）每次取数时须从每行各取走一个元素，共n个。m次后取完矩阵所有元素； 2）每次取走的各个元素只能是该元素所在行的行首或行尾； 3）每次取数都有一个得分值，为每行取数的得分之和，每行取数的得分 被取走的元素值*2i，其中i表示第i次取数（从1开始编号）； 4）游戏结束总得分为m次取数得分之和。 对于任意矩阵，可以求出取数后的最大得分 -2 for a given n*m matrix,
滤波及线性拟合算法
- 高通、低通滤波算法，及线性拟合算法C#源码