搜索资源列表
searchmin
- 根据分治算法策略，来实现对一个系列中最小数的查找．-under the divide-and-conquer strategy to achieve a series of the smallest number of search.
ConquerServerSource
- 征服服务端源代码 什么版本自己去研究,不过可以肯定是2.0以上版本的外国源代码-Conquest of what version of server-side source code for their own to study, but you can certainly be 2.0 or above versions of the foreign source code
msdar
- Conquer online Source Code Patch 5165
C-Sharp-MaxSubsequenceSum
- An implementation of the Max Sub-sequence sum algorithm using divide and conquer. Includes driver program. Perfect for students. -An implementation of the Max Sub-sequence sum algorithm using divide and conquer. Includes driver program. Perfect for
1
- 用分治法求第k小元素 输入：程序从标准输入读入数据，第一行是一个整数n (1=<n<=100000)表示元素的个数，接下来的n行中每行有一个整数。最后一行是k，就是我们要找的第k小元素。 -Method used divide and conquer a small element of k-input: program read from standard input data, the first line is an integer n (1 = <n<
max-and-min
- 算法与数据结构，分治算法求最大值最小值，也是一次作业-Algorithms and data structures, divide and conquer algorithm
chessboard
- 采用分治算法完成棋盘覆盖问题的求解，用C#完成了棋盘覆盖的界面显示。-Using divide and conquer algorithm to complete the board covering problem solving, finished with C# interface display board covered.
Exhaustive-N-binary-system-number
- 列举N位二进制数，的分治递归算法，由C语言写成，附带运行，生成文件-Enumerate the N-bit binary number, divide and conquer recursive algorithm, written in C, with run to generate the file
Round-robin-schedule
- 采用了递归分治的思想，解决了循环赛日程表的安排。-The idea of using a recursive divide and conquer to solve the arrangement of the round-robin schedule.
fenzhifa
- 分治法求数组中最大值和最小值，与普通方法比较-Divide and conquer method for the maximum and minimum values in the array, compared with the conventional method
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
C-yuyan
- 基于C语言的一些算法分析及实现，主要有动态规划，分治，搜索算法等-Some algorithm analysis and implementation of C language based mainly on dynamic programming, divide and conquer, the search algorithm
[Mini-book]-conquer-c-pointer
- 【迷你书】征服c指针,一本非常好的c语言书，值得-[Mini-book] conquer c pointer, a very good c language books worth a look
MaxMinDemon
- 计算一个数组中的最大最小值，分别使用直接计算和分治法计算，利用C#实现。-Maximum and minimum calculation in an array, were calculated using the direct calculation and divide and conquer, the use of C# implementation.
QuickSort
- 快速排序（快速排序）是一种快速排序算法，它被广泛应用于实践。它是用于分而治之的原则。快速排序的工作原理是划分一个给定的数组A [P。 。 R]分成两个非空的子阵列A [页。 。 Q]和A [Q + 1。 。 R]使得在[P每个元素。 。问]是小于或等于每个元素A [Q + 1。 。 R]。然后两个子阵列被递归调用快速排序排序。快速排序的细节描述如下： 1.选择一个支点值（基准）。您可以采取的第一个元素的值 枢轴值，但它可以是任何值，这是在排序的值的范围，即使它不存在于阵列中。 2.分
ItemLog
- tq server item conquer online
include
- 1)随机输入平面上n个点的集合； 2)使用分治策略编制计算机程序求出这n个点的极大点。 3)编程实现2维极大点问题的求解，且在程序中体现分治策略。程序能处理任意的n个点。 -1) a collection of n points on a random input plane 2) using divide and conquer strategy computer program to calculate the maximum point of the n point.