搜索资源列表
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq
ICEIC2006_hybridarchitecture
- This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architec
QuickSort
- Quicksort is a divide and conquer algorithm. Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists. The steps are: Pick an element, called a pivo
Sierpinski
- Sierpinski镂垫： 是一个非常有趣的图案， 有着悠久的历史， 在分形几何中等领域里引起了人们极大地兴趣， 是用递归和随机方式定义的几何形状， 在极限情况下， 它所表现的性质并没有随机性。 -Sierpinski gasket: It is a very interesting pattern, has a long history in the field of fractal geometry moderate aroused great interest is the use
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
hw2
- 最优算法的判别与给出特定文法判断其是否为自下而上的递归-Identification and optimal algorithm gives specific grammar determine whether it is a bottom-up recursion
1
- 八皇后问题是求出在一个n×n的棋盘上，放置n个不能互相捕捉的国际象棋“皇后”的所有布局（皇后可以沿着纵横和两条斜线4个方向相互捕捉）的问题。是一种比较常见的练习C语言递归或者栈使用的程序问题。-Eight queens problem is to find an nn chessboard, place of n are not mutually capture chess " queen" of all the layout (Queens and two along the
recursion
- 数据结构中的递归与非递归的实现与区别以及动态规划的思想。-Recursive data structures and non-recursive and differences as well as the realization of the idea of dynamic programming.
hannuota
- 汉诺塔递归算法 初学者学习递归很不错的源码-Tower of Hanoi recursive algorithm for beginners to learn recursion is a good source
Test
- Koch雪花的构图方法，递归模型的实现算法，建立平面二维坐标系，原点位于屏幕客户区中心，x轴水平向右为正，y轴铅直向上为正。 以原点为圆心绘制半径为r的圆，与y轴交于P0点。从P0点开始，顺时针方向将圆三等分，得到P1和P2点。P0P1P2构成等边三角形。 沿着等边三角形的三条边外侧分别绘制三段递归深度为4，夹角为60°的Koch曲线，形成Koch雪花。 -Koch snowflake patterning method, recursive algorithm model, the
LL1
- 编译原理中的LL1语法分析程序 包括消除左递归， First集和Follow集自动生成， 预测表自动生成， 对输入的句型进行分析。-Compiler theory LL1 syntax analysis procedures, including the elimination of left recursion, First Set and Follow automatically generated prediction table is generated automatically an
zhishu
- 改进的递归算法，输出100以内的质数，VB.NET程序。通过已经得到的质数，算出下一个质数。-output the prime number within 100 Using improved recursion algorithm, the programe is coded with vb.net. Through got prime, calculate the next prime Numbers.
cpfolder
- A recursive copy file function, can copy the folder file recursion.
GenCom
- 字符串组合高效算法竞彩项目中，对选择的多组比赛进行组合过关和赛果组合拆分。 这是一个对字符串组合算法的示例，使用选号标记移位算法和笛卡尔积进行计算，避免使用递归，效率极高。-String combination efficient algorithm SMG project, the selection of multiple race combinations clearance and Results combination splits. This is an example of
recursion
- 用vc2008创建的一个递归模型，程序里面注释的部分去掉就是一个赛平斯基垫片程序。-Created using a recursive model vc2008, procedures which remove the comment part of the gasket is a race Lipinski program.
test
- 用C语言实现对迭代法，二分法查找和两者的递归形式的时间复杂度的测试-in c language,test the time complexity of binary and iteration search and their recursion.
fibonacci-recursion
- 斐波那契数列的递归算法实现的源代码，计算机算法设计与分析作业1-Fibonacci series recursive algorithm source code, design and analysis of computer algorithms operating 1
main
- 复制一个广义表的程序，主要是在自己定义了一个广义表以后，用程序的形式将它复制，没有递归-Copy a generalized form of the program, mainly in their definition of a generalized form after application form, copy it, no recursion
introduction-of-adp
- 自适应动态规划介绍。一种求解动态规划方法HJB方程的自学习控制算法，称其为自适应动态规划算法。所提的算法可以用来解决未知离散时间非线性系统的最优控制问题，同时给出了该控制算法的收敛性证明。算法的实现用到了三个神经网络，在递推的每一步分别用来近似性能指标函数、最优控制律和未知非线性系统。-Adaptive Dynamic Programming introduction. Dynamic programming method for solving the HJB equation self-le
left-crusion
- 消除左递归，包括自上而下的非递归分析和自上而下的分析-Eliminate left recursion, including non-recursive top-down analysis and top-down analysis