Search - max - CodeBus

Search - max - List

[Data structs] min-max-array DL : 0: A simple programm that finds minimun and maximun value of 10 elements.
Date : 2012-02-22 Size : 484byte User : besoyal@yahoo.gr
[Data structs] 最优化 DL : 0: 运筹学中，用单纯性算法来实现最优化max准则的源程序。因为是初学者，可能有些不标准请谅解-tacticians, and use simple algorithms to achieve optimal max guidelines of the source. Because beginners, some may not please standards of Understanding
Date : 2025-12-28 Size : 3kb User : 岳晓林
[Data structs] max_sum DL : 0: 求和最大的子序列，采用动态规划算法，经典算法-sequences using dynamic programming algorithm, the algorithm classic
Date : 2025-12-28 Size : 12kb User : 王菲
[Data structs] cmoban DL : 0: 参照栈类模板的例子编写一个队列类模板class <T> Queue，私有成员包括：队首指针Front，队尾指针Tail，队列容积max。实现：构造函数Queue，析构函数，入队函数In，出队函数Out（每次出队，后面的元素自动前移一位），判队列空函数Empty。并分别用队列类模板定义int和float对象，调用各个成员函数-reference stack class template examples of the preparation of a class template class Queue
Date : 2025-12-28 Size : 3kb User : gongwen
[Data structs] Bala DL : 0: 给定n个整数a , a , ,an 1 2  组成的序列。序列中元素i a 的符号定义为： ï î ï í ì - < = > = 1 0 0 0 1 0 sgn( ) i i i i a a a a 符号平衡问题要求给定序列的最长符号平衡段的长度L，即： þ ý ü î í ì = + - = å = £ £ £ max 1| sgn( ) 0 1 j k i i j n k L j i a 。例如，当n=10，相应序列为：1，1，-1，-2，0，1，3，-1，2，-1 时，L=9。-given n integers a, a, and an 1 2
Date : 2025-12-28 Size : 59kb User : 张三
[Data structs] MAX DL : 0: 大整数乘法的详细实行比如说1246*2566用此法可降低时间复杂度并且能过有效算出-large integer multiplication detailed implementation of the 1246* 2566 for instance, tried to use this method can reduce the time complexity and can Guo calculated effective
Date : 2025-12-28 Size : 28kb User : huanghui
[Data structs] No11 DL : 0: 本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。 -This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then will use this strategy to solve the following problem: min max problem, matrix multiplication, incomplete chessboard, sort, select, and a computational geometry problems- to identify two-dimensional space in the nearest two points.
Date : 2025-12-28 Size : 40kb User : 张波
[Data structs] No22 DL : 0: 本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。 -This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then will use this strategy to solve the following problem: min max problem, matrix multiplication, incomplete chessboard, sort, select, and a computational geometry problems- to identify two-dimensional space in the nearest two points.
Date : 2025-12-28 Size : 39kb User : 张波
[Data structs] Prim DL : 0: 用prim算法实验最小生成树本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.
Date : 2025-12-28 Size : 92kb User : Tina612
[Data structs] ToTheMax.tar DL : 0: ACM题解： To The Max 一个应用动态规划的例子-ACM Solutions title: To The Max An application of dynamic programming examples
Date : 2025-12-28 Size : 60kb User : 夏雨可
[Data structs] 3_list DL : 0: 三：针对带表头结点的单链表，试编写下列函数。 (1) 定位函数Locate：在单链表中寻找第i个结点。若找到，则函数返回第i个结点的地址；若找不到，则函数返回NULL。 (2) 求最大值函数max：通过一趟遍历在单链表中确定值最大的结点。 (3) 统计函数number：统计单链表中具有给定值x的所有元素。 (4) 建立函数create：根据一维数组a[n]建立一个单链表，使单链表中各元素的次序与a[n]中各元素的次序相同，要求该程序的时间复杂性为O(n)。 (5) 整理函数tidyup：在非递减有序的单链表中删除值相同的多余结点。-III: Table for the first node with a single list, try to prepare the following function. (1) positioning function Locate: find a single list in the first i nodes. If found, the function returns the first i nodes of the address if not, the function returns NULL. (2) for the maximum function max: traverse through the trip in a single list to determine the value of the largest node. (3) statistical function number: single-chain statistics with a given value of x of all elements. (4) the establishment of function create: the basis of one-dimensional array a [n] the creation of a single list, so that a single list in the order of each element with a [n] in the order of the elements the same time require the complexity of the procedure for O (n). (5) collate function tidyup: in non-descending order to remove a single list of surplus value of the same node.
Date : 2025-12-28 Size : 16kb User : 卡米力江
[Data structs] S030602102 DL : 0: 赋权有向图中心问题问题描述: 设G=(V,E)是一个赋权有向图，v是G的一个顶点， v的偏心距定义为： Max {w∈ V,从w到v的最短路径长度} G中偏心距最小的顶点称为G的中心。试利用Floyd 算法设计一个求赋权有向图中心的算法。-Empowering the central issue Digraph Problem Description: Let G = (V, E) is a directed graph Empowering, v is a G vertex, v is defined as the eccentricity: Max (w ∈ V, from w to v the shortest path length) G the minimum eccentricity of the vertex as the center of G. Try using Floyd algorithm for the design of a plan to empower the center to the algorithm.
Date : 2025-12-28 Size : 82kb User : 林建
[Data structs] banker DL : 0: 银行家算法的MFC模拟程序,可输入MAX，ALLOCAT数值，计算安全序列-Banker s algorithm designed in MFC
Date : 2025-12-28 Size : 3.14mb User : niepan
[Data structs] second_max DL : 0: 以高效率的方法查找一个数组中的第二大数，数组中的数可以相同.同时对各种可能发生的错误返回相应得错误代码。-find second max number in a high effective method.The number in the array could be the same.meanwhile ,the program return special error code
Date : 2025-12-28 Size : 1kb User : 龙熹
[Data structs] max DL : 0: 求最大值-find the max
Date : 2025-12-28 Size : 140kb User : jo.jol
[Data structs] max DL : 0: c++编程求最大值，用的是递归算法，非常简单和方便的，这是针对链表的-c++ programmer seeking maximum, using a recursive algorithm is very simple and convenient, this is for the list
Date : 2025-12-28 Size : 1kb User : 王金
[Data structs] searchthemaxandmininarray DL : 0: 分治思想是算法中很常用的一种技巧。在N个数中求最小值Min和最大值Max，我们只需分别求出前后N/2个数的N/2个数的Min和Max,然后取较小的Min,较大的Max即可（只需较大的数和较大的数比较，较小的数和较小的数比较，两次就可以了）。-You can use the procedure to find the Minnumber and the Maxnumber in the array.
Date : 2025-12-28 Size : 1kb User : 徐天扬
[Data structs] assign5 DL : 0: 利用heap实现三叉树的组建，插入，排序。分析推导算法的时间复杂度。 - create a max heap class that is based on a complete ternary tree. As with a complete binary tree max heap, the largest value is at the root and the root is at location 1 in the vector holding the heap. Location 0 is unused.1）insert2）delete3）build
Date : 2025-12-28 Size : 6kb User : chengxiaoxin
[Data structs] Heaps DL : 0: a heap class + program wriitten in c++. it implements a max heap
Date : 2025-12-28 Size : 2kb User : miss24
[Data structs] Max-heap DL : 0: 利用C++编程语言解决数据结构中的最大堆问题。-Using C++ programing language to solve the problems of Max-heap in data structure.
Date : 2025-12-28 Size : 3.89mb User : 祝山峰

« 12 3 »