搜索资源列表
Hanio
- 汉诺塔游戏的设计 汉诺塔问题是最经典的递归问题-Tower of Hanoi Tower of Hanoi game design is the most classic recursion problem
MergeSort
- mergesort分治排序 - 先产生1000个随机数，连续分为3组，直到每组只剩k个元素，分别排列每组数，再用分治法合并数组-mergesort- randomly generate 1000 numbers, then split it into thirds, subarray is of size- k, stop the recursion and use insertion-sort to sort the subarray, then merge sort
RandomizedQuicksort
- The steps are: 1. Pick an element, called a pivot, from the list. 2. Reorder the list so that all elements which are less than the pivot come before the pivot and so that all elements greater than the pivot come after it (equal values can go ei
hanoi
- Hanoi塔的递归调用和消除尾递归的方法，附带算法的设计思路和分析-Hanoi Tower recursive calls and the elimination of tail recursion method with the algorithm design and analysis of ideas
acm..
- 自相关法求全极点模型参数； 下行递归； 逆Levinson-Durbin递归（模型参数~自相关序列）； 平均周期图的Bartlett方法； Blackman-Tukey功率谱估计。-Autocorrelation perfection pole model parameters downward recursion inverse Levinson-Durbin recursion (model parameters ~ autocorrelation sequence)
Data_Structure_C
- 基本数据结构的C实现。包括: （1）线性顺序表 （2）单链表 （3）双向循环链表 （4）顺序栈 （5）链式队列 （6）循环队列 （7）二叉树的先序、中序、后序的递归遍历和非递归遍历。-C-realization of the basic data structure. Include: (1)Sq_List (2)Linked_List (3)Du_linkedlist (4)Sq_Stack (5)Linked_Queue (6)Cycl
Sierpinskiditan
- 给定不同的递归深度，通过使用海绵算法，绘制Sierpinski地毯，在三维环境中按照画家算法绘制20个小立方体-Given the different recursion depth, by using the sponge method, drawing Sierpinski carpet, in the three-dimensional environment, according to Painter' s algorithm draw 20 small cubes
zuidashang
- 最大熵是图像阈值分割里常用的一种简单且效果明显的方法。该代码是最大熵算法的快速递推形式。-Maximum Entropy is Image Threshold Segmentation ri common a simple and obvious effect method. The code is maximum entropy algorithm rapid recursion forms.
DE
- 用数组模拟递归函数，实现递归函数的简化算法，具体要求看英文描述。-We all love recursion! Don t we? Consider a three-parameter recursive function w(a, b, c): if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns: 1 if a > 20 or b > 20 or c > 20
hanruota
- 递归经典例子--汉诺塔程序，用C#写成，可视化界面。-Classic example of recursion- Tower of Hanoi program, written using C#, visual interface.
A_class_of_Linear_ODE_WITH_Finite_Recursion
- 求一类常系数线性常微分方程特解的有限递推法-A class of Linear Ordinary Differential Equations with Finite Recursion
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
XMLparserforc
- 将树形数据结构用于最小化DOM 模型XML 编解码器的开发。在解析XML 文本时，基于Expat 解释器将XML 字符串构造成树 状结构；编码时构造DOM 树结构，采用非递归深度优先法遍历树，将其串行化成XML 串。本编解码器解决了国际化语言关键问题，是 一个通用、高效的工业级XML 应用支撑模块。-This paper designs a DOM liked tree data structure for developing a minimal DOM based eXtended
__xmlParser
- XML解析类，轻巧、简单、易用(内含源码、示例程序以及文档说明)-This is a basic XML parser written in ANSI C++ for portability. It works by using recursion and a node tree for breaking down the elements of an XML document.
Fractal
- 分形算法设计，包括摇曳的分形递归树、摇摆的Sierpinski三角形、万花筒和王冠（Julia集）-Fractal algorithm design, including the fractal recursion trees swaying, rocking the Sierpinski triangle, Kaleidoscope and the crown (Julia set)
musicdsp
- musicdsp source code archive-Analysis Beat Detector Class Coefficients for Daubechies wavelets 1-38 DFT Envelope detector Envelope Detector class (C++) Envelope follower with different attack and release Fast in-place Walsh-Hadamard Tra
Practice2
- 用普通递归与消除尾递归的方法实现解决汉诺塔问题c#-With general recursion and tail recursion elimination method to solve Tower of Hanoi problem c# implementation
Fractral4
- 初步介绍分形编程，示例中显示了4种分形图案，递归算法简单易懂。-Introduction to fractal programming, the example shows four kinds of fractal patterns, recursion is easy to understand.
Levinson
- 采用列文逊递推算法求解对称托伯利兹型方程组。其中t存放T型矩阵的元素。b是右端常数向量。x是解向量。n是阶数。-Using Levinson recursion algorithm for symmetric Tuobolizi equations. Where t T-matrix elements of deposit. b is the right end of the constant vector. x is the solution vector. n is the order.
MARYUWA
- c语言编写的DSP程序，用Yule-Walker方程，采用levinson递推实现功率谱估计。-c language of the DSP program, with the Yule-Walker equations, levinson recursion to achieve power spectrum estimation.