搜索资源列表
maxamin
- 如何用分治法求一个数组中的最大值和最小值-With the Method find an array of maximum and minimum values
zui-you-he-bing
- 一种用C++语言实现的算法，可以求二路归并的最小合并次数-A C++ language using an algorithm that can find the minimum combined number of way merge
java
- 编写程序，从键盘获取6个整数，从中找出最大的和最小的，并输出。-Write a program to get six integers from the keyboard to find out the maximum and minimum, and outputs.
lines
- 线搜索求简单单峰值函数的最小值程序设计，算法采用固定搜索方向方法。-Simple single-peak line search function to find the minimum programming
tulun
- 一个实现最小生成树的程序，通过输入图的路径来找到该最小生成树-A program to achieve the minimum spanning tree, by entering that path to find the minimum spanning tree
At-least-the-issue-of-coins
- 有n种不同面值的硬币，各硬币面值存于数组T[1:n] 现用这些面值的钱来找钱；各面值的个数存在数组Coins[1:n]中。 对于给定的1<=n<=10，硬币面值数组、各面值的个数及钱数m，0<=m<=2001，编程计算找钱m的最少硬币数。 -There are n different denominations of coins, each coin denomination stored in the array T [1: n] current face v
money
- traversing a graph and find the minimum of it
prim
- /*分别利用prim算法和kruskal算法实现求图的最小生成树*/-/* Use, respectively, and kruskal prim algorithm graph algorithms find the minimum spanning tree* /
4
- 随机产生20个[10，50]的正整数存放到数组中，并求数组中的所有元素最大值、最小值、平均值及各元素之和-Random 20 [10, 50] of positive integers stored in an array, and find all the elements in the array maximum, minimum, average and the elements and
Kruskal
- 求最小生成树，Kruskal算法实现，想学Kruskal算法可以参考一下-Find the minimum spanning tree, Kruskal algorithm, Kruskal' s algorithm can refer to learn about
cities
- 简单小程序，点击设置城市，也可点击设置城市之间离，并求出两城市之间最小距离-Simple applet, click the Settings cities, between cities can be set to click away and find the minimum distance between two cities
Rosenbrock
- The Rosenbrock function is a non-convex function used as a performance test problem for optimization algorithms introduced by Rosenbrock (1960). It is also known as Rosenbrock s valley or Rosenbrock s banana function. The global minimum is insid
shuangduandui
- 双端队列应用于优化算法，解决竞赛题：由题目所说，Mr Pote有n个袋子装豆子。Mr Pote从中进行挑选包装，要求找出连续一列袋子，使得它们的豆子总和s在满足s p<=k条件下最大 ，以保证被狗狗吃掉的最少，并且Mr .Pote装的豆子最多。最后输出狗狗吃掉的豆子数目，即s p的结果。 抽象后表述为：给定n,p,k,以及n项数列[wi]，要求找出其一个连续子序列，使得其和s在满足s p<=k的条件下最大，输出s整除p的结果。-Double-ended queue used in
Apriori
- 该算法应用于单维、单层、布尔关联规则，其核心是基于两阶段频集思想的递推算法。首先找出所有的频集，这些项集出现的频繁性至少和预定义的最小支持度一样。然后由频集产生强关联规则，这些规则必须满足最小支持度和最小可信度。-The algorithm is applied to one-dimensional, single-layer, Boolean association rules, its core is based on the idea of a two-stag
cutcake-c
- 切蛋糕c语言实验源码，内容为：一个矩形蛋糕，长宽都是正整数，要求用户输入蛋糕的长和宽，并且由用户决定切分成多少块，编写一个函数求怎样切割使得最大的那一块面积最小,并输出最大的那一块的面积。-Cut the cake experiment c language source code, content: a rectangular cake, length and width are positive integers, requiring the user to enter length and
dark-channel
- 寻找最低像素值的matlab实现：通过图像矩阵的循环查找，能实现最低像素值的快速寻找-Matlab find the lowest pixel value to achieve: to find the cycle through the image matrix, to achieve the minimum pixel value Quick Find
extremuma
- a fast and precise algoritm to find local maximum or minimum
Hash-table-lookup
- 哈希表查找，一种地址查找，各查找中时间复杂度最小-Hash table lookup, an address lookup, find the time complexity of the minimum
strcon
- 对于给定的n个字符串，请找出一种最佳的连接方式，使得采用该连接方式得到的字符串在所有连接的结果中，字典序最小-For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum
5QQ
- 输入三个整数x,y,z，请把这三个数由小到大输出。1.程序分析：我们想办法把最小的数放到x上，先将x与y进行比较，如果x>y则将x与y的值进行交换， 然后再用x与z进行比较，如果x>z则将x与z的值进行交换，这样能使x最小-Enter three integers x, y, z, the number of small to large output of these three please. 1 program analysis: we find a way to p