Search - Recursion algorithm

Search - Recursion algorithm - List

[Other] Findfile DL : 0: Findfile 利用递归算法查找文件的例子，d5及以上支持-Findfile use recursion algorithm search document example, d5 and above supports
Date : 2026-01-08 Size : 8kb User : 彭广
[Other] lianliankan1 DL : 0: 利用递归来求的，其实连连看的搜索算法也就是搜索从一个点到另外一个点的不超过两次转弯的最短距离！-use recursion to seek the 1000 block of Terry Avenue fact, the search algorithm is a search from one point to another point of not more than twice the minimum distance between turning!
Date : 2026-01-08 Size : 2kb User : 潘洪峰
[Other] ClosetPairs DL : 0: 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
Date : 2026-01-08 Size : 25kb User : lhguo
[Other] CommonAlgorithmDesign DL : 0: 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
Date : 2026-01-08 Size : 66kb User : YuMy
[Other] Fractal DL : 0: 分形算法设计，包括摇曳的分形递归树、摇摆的Sierpinski三角形、万花筒和王冠（Julia集）-Fractal algorithm design, including the fractal recursion trees swaying, rocking the Sierpinski triangle, Kaleidoscope and the crown (Julia set)
Date : 2026-01-08 Size : 1.88mb User : 卜少锋
[Other] Round-robin-schedule DL : 0: 循环赛日程表。大学算法分析与设计的实验课题目。有递归和非递归两种方法，这里上传递归，仅供参考！-Round-robin schedule. Head of the University of algorithm analysis and design of experimental subjects. There are two methods of recursive and non recursive upload recursion, for reference purposes only!
Date : 2026-01-08 Size : 1kb User : Alex
[Other] erchashubianli DL : 0: 二叉树中序遍历递归算法演示，用图形描绘了是怎么用递归算法遍历二叉树，很形象直观。-Binary tree Recursion algorithm
Date : 2026-01-08 Size : 8kb User : 胡琴
[Other] Greatest-common-divisor-(GCD) DL : 0: 用递归调用和辗转相除法求两个整数的最大公约数（输入多组数据，每个数在1到1000之间；输出为一行一个公约数）。-Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follows: Let m and n be variables containing the two numbers. If n is 0, then stop: m contains the GCD.Use recursion.(There will be multiple input sets. The line contains two integer between 1 and 1000. For each test case, output one line.)
Date : 2026-01-08 Size : 3kb User : Lee·K
[Other] code DL : 0: 使用回溯法解决的典型问题的算法：骑士巡游问题，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 conquer strategy algorithm to solve the problem of few: tower of Hanoi problem and binary search technology.
Date : 2026-01-08 Size : 3kb User : 阿丁汤圆
[Other] Generate-Permutation DL : 0: 算法设计，递归方法设计生成，1,2.。。。n的所有排列-Algorithm design, recursion method is designed to generate, 1,2. . . all permutations of n
Date : 2026-01-08 Size : 310kb User : 微微
[Other] diguishuchushuzu DL : 0: 递归算法是把问题转化为规模缩小了的同类问题的子问题。然后递归调用函数（或过程）来表示问题的解。用递归来输出数组非常简单。-Recursive algorithm is to reduce the size of the problem into sub-problems of similar problems. Then recursively call the function (or process) to represent the solution of the problem. Use recursion to the output array is very simple.
Date : 2026-01-08 Size : 6kb User : 黄忠
[Other] grammar DL : 0: 第1章算法引论　　1.1 算法与程序　　1.2 表达算法的抽象机制　　1.3 描述算法　　1.4 算法复杂性分析　　小结　　习题　　第2章递归与分治策略　　2.1 速归的概念　　2.2 分治法的基本思想　　2.3 二分搜索技术　　2.4 大整数的乘法　　2.5 Strassen矩阵乘法　　2.6 棋盘覆盖　　2.7 合并排序　　2.8 快速排序　　2.9 线性时间选择　　2.10 最接近点对问题　　2.11 循环赛日程表　　小结　　习题　　第3章动态规划　　3.1 矩阵连乘问题　　3.2 动态规划算法的基本要素　等(The first chapter is an introduction to Algorithms 1.1 algorithms and programs Abstraction mechanism of 1.2 expression algorithm 1.3 description algorithm Complexity analysis of 1.4 algorithms Summary exercises The second chapter recursion and divide and conquer strategy The concept of 2.1 speed return The basic idea of 2.2 points therapy 2.3 two point search technology Multiplication of 2.4 integers 2.5 Strassen matrix multiplication 2.6 checkerboard coverage 2.7 merge sort 2.8 quick sort 2.9 linear time selection 2.10 closest point pair problem 2.11 round robin calendar Summary exercises The third chapter dynamic planning)
Date : 2026-01-08 Size : 2.27mb User : Summer-LXN