搜索资源列表
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
matlabxuexi
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This is a good model to study the information, download it quick
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
strassen-web
- 算法课中的矩阵乘法，strassen问题求出几个矩阵的乘积，用divide and conquer思想-Implement the Strassen algorithm algorithm for MatrixMultiplication problem in your favourite language, and compare the performance with grade-school method.
merge-and-count
- 完成sort and count算法，是算法分析当中devide and conquer中的一道题-The attached file Q5.txt contains 100,000 integers between 1 and 100,000 (each row has a single integer), the order of these integers is random and no integer is repeated. 1. Write a program to
zuoye5
- 二分检索（分治法）给定递增整数序列L，其大小为n，要求使用二分查找法查找任意元素的位置k(序列中第几个)。-Binary search (divide and conquer) given increasing sequence of integers L, and its size is n, and requires the use of binary search method to find the location of any element k (sequence of sever
zuoye6
- 矩阵乘法（分治法） 设A 和 B 是两个n * n阶矩阵，求它们两的乘积矩阵C。-Matrix multiplication (divide and conquer) Let A and B be two n* n order matrix, find the product of their two matrix C.
juzheng
- 矩阵乘法（分治法） 设A 和 B 是两个n * n阶矩阵，求它们两的乘积矩阵C。-Matrix multiplication (divide and conquer) Let A and B be two n* n order matrix, find the product of their two matrix C.
zuoye7
- 第k小元素（分治法） 给定一个线性序列集，要求求出其中指定的第K小的数的值和位置.如给定n个元素和一个整数i，1≤i≤n，输出这n个元素中第i小元素的值及其位置；-First k small element (divide and conquer) Given a set of linear sequence, where the specified requirements determined the K value and the small number of locations, s
divide-and--conquer
- 实现大整数相乘，时间复杂度n(logn),c++源码-Achieve a large integer multiplication, time complexity n (logn), c++ source
maxfieldsum
- 用分治法解决最大子段和问题,利用了递归和合并，使问题能够简易求解-Solve the problem with the largest sub-segment and divide and conquer method, the use of recursion and merge so that the problem can be solved simple
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and