资源列表
Peking-University-ACM-solution
- 北京大学的ACM题解，搞算法的朋友可以参考下-Peking University ACM problem solution, out algorithm can refer to a friend
Introduction-to-Algorithms
- 算法导论的习题答案，最完整的版本，学习算法的朋友可以参考-Introduction to Algorithms answer exercises, the most complete version of the learning algorithm can refer to a friend
hierarchical
- Thhuat toan trong khai pha du lieu(Data Mining)
Correlation_Coefficient_1
- 相关系数法求解系统的脉冲响应函数Correlation coefficient method to solve the system of the impulse response function-Correlation coefficient method to solve the system of the impulse response function
Linear-search-technology
- 线性搜索技术 Linear search technology -Linear search technology
exact
- 这个源代码再输入初始条件后，可以用来求解一维rieman问题精确解。-The source code can be used to solve the exact solution of the Rieman problem after input the initial conditions.
lw.
- 这是个用Richtmyer格式加入了人工粘性项编写的源代码，输入初始条件后，可以用来求解rieman问题的数值解-This is a Richtmyer format of the source code with artificial viscosity , after input the initial conditions, can be used to solve the numerical solution of the rieman problem
erweichazhi
- 用C++完成二维双线性插值的功能。根据给定的X和Y值来插值获得Z的值。-bilinear interpolation using C++
c2
- 计算斐波那契（Fibonacci）数列的第n项函数fib（n）-Write Fibonacci calculation (Fibonacci) sequence of the first n terms function fib (n)
c4
- 装箱问题 问题描述：装箱问题可简述如下：设有编号为0、1、…、n-1的n种物品，体积分别为v0、v1、…、vn-1。将这n种物品装到容量都为V的若干箱子里。约定这n种物品的体积均不超过V，即对于0≤i＜n，有0＜vi≤V。不同的装箱方案所需要的箱子数目可能不同。装箱问题要求使装尽这n种物品的箱子数要少-Packing problem Problem Descr iption: Packing problem can be summarized as follows: with numbe
3
- 这个是NP问题的PPT,内容丰富,讲解到位,经典的算法学习资料.-This problem is NP PPT, rich in content, to explain the place, the classical algorithm learning materials.
yiqunxitong
- 蚁群算法开发tsp问题，可运行。已经修改-Ant colony algorithm development tsp problem, run. Has been modified