搜索资源列表
binsearch
- 分治二分检索递归,算法设计与分析中的经典算法,值得大家参考学习。-Binary search recursive divide and conquer algorithm design and analysis of the classical algorithm, it is worth your learning.
grid
- 分治算法的直观应用,有GUI。即在8*8的格子中放一块障碍,求一种分配方案使得能用相同的直角方块(共3块成L字形)铺满整个方格。-Divide and conquer algorithm intuitive applications, there GUI. Ie 8* 8 grid put an obstacle, seeking an allocation scheme makes possible the same rectangular box (a total of three L-sh
suanfa3
- 这题是用分治算法中的折半查找,针对的是一个有序数组,把数组分而治之,把输入分成两个与原来相同的子问题,如果规模还太大,我们对这些子问题再做上述处理,直到这些子问题容易解决为止。这种算法是一种效率很高的算法,每一次循环,它都能将数组的规模减少到原来的半,其空间复杂度是O(log(n))次。-This question is divide and conquer algorithm binary search is for an ordered array, the array of divide
2-garments-by.warzone-tutoriais
- 2 garments for conquer server online private
pvp
- scr ipt pvp binary tq conquer online
round-robin-schedule
- 分治法 循环赛日程表 设计队伍之间的比赛安排-Divide and conquer design team round robin schedule arrangements between the competition
lysfreuU
- 征服登录器配置 登陆器生成器 登陆器 全部源码-Conquer the register configuration landers generator landers source code
round-robin-schedule
- 分治法 循环赛日程表 设计队伍之间的比赛安排-Divide and conquer design team round robin schedule arrangements between the competition
ADS1115
- 本例仅供参考,希望各位在浏览程序的同时去看看ADS1115的Datasheet, 这样才能更深刻的体会到怎么去看懂一个芯片的数据手册,当自己拿着 一块从来没有接触过的芯片的时候能凭借自己的能力征服它。-This example is for reference only hope that the viewer to look at while the ADS1115 Datasheet, So as to more deeply understand how to read a d
medo
- 设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。 编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中-Let X [0: n- 1
2_a25
- 利用C语言,并使用分治算法,解决最近点对问题。-The use of C language and use divide and conquer algorithm to solve the problem closest point.
STRING
- 使用分治思想,利用C语言,求得最长公共子串问题-Using Divide and Conquer, using C language, and seek the longest common subsequence problem
UnrealEngine_3
- This the secret about programing matlab whch use by naruto and sasuke to conquer konohagakure-This is the secret about programing matlab whch use by naruto and sasuke to conquer konohagakure
matlabxuexi
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法:模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法)-This is a good model to study the information, download it quick
algorithm
- 算法的基础,分治法与递归式求解,算法的价值-Algorithm based on recursive divide and conquer method and solving algorithm value
SUANFAclass
- 算法中有关最小堆的算法,插入删除等。以及分治算法,排序算法-Algorithm for minimum heap algorithm, insert or delete. As well as divide and conquer algorithm, sorting algorithm
vcsortorder
- 各种排序算法大全c++版 直接顺序排序、冒泡排序,选择,快排,希尔排序,堆排序,归并排序、筛选法调整堆、堆排序、一次归并、一趟归并法排序、归并排序的非递归算法、归并排序的递归算法、将两个已排序的子序列归并。-Various sorting algorithms Daquan c++ Version Direct Sequence sort, bubble sort, selection, fast scheduling, shell sort, heap sort, merge sort, fi
hongheishu
- 分治法实现三维最接近点对问题,对分治法的学习有很大的帮助-Divide and conquer method to achieve three-dimensional nearest point of the problem, divide and conquer method for learning a great help
bigNumMult
- 计算1万位以上的大整数乘法,有蛮力法和分治法-Calculation 10,000 more than the large integer multiplication with brute force method and the divide and conquer
bigIntMuilt
- 分治法求大整数乘法 只能支持256位乘法而已,不过已经完整实现了分治法,而且可以支持有符号的数-Divide and conquer method for large integer multiplication multiply it can only support 256, but has been completely realized divide and conquer, and can support a number of symbols