搜索资源列表
最大子数组
- 最大子数组
1
- 在一个一维数组里找出连续的几个数,使数的总和最大，计算最大子段-In a one-dimensional array of several successive years to find out the number, so that the sum of the number of the largest sub-segment calculating the maximum
Sort
- 实现了插入、冒泡、选择、快速、希尔、堆、归并、基数排序。实现了字符串全排列、字符串逆序、查找数据中最大子序列、外存大文件排序；kmp字符串匹配、feibonacci数列计算、求数组主元素。等算法-sort test , Big data sort, kmp
MaxSum
- 求1维数组最大子段和,适合初学者，算法设计与基础，写的通俗易懂，且正确-Seeking the largest sub-segment of a one-dimensional array, suitable for beginners, algorithm design and basic written in easy to understand, and correct
HuanTwoArray
- 该实验的功能事实现环状的数组找出最大的子数组，并输出最大子数组及子数组的和-The experimental realization of an annular array of features to find out what the largest sub-arrays, and the maximum output and sub-sub-arrays and arrays
MaxArrayLocationFind
- 面试算法：最大子数组之和及其坐标位置快速算法，通过二分查找快速查找。-Interview algorithms: coordinate position and its largest sub-array of fast algorithm, binary search to quickly find.
C
- 含随机出题（四则运算）及其迭代程序、返回数组中最大子数组和及其迭代程序等。-Software class operations, including four operations and iterative procedure, returns an array of sub-arrays and the largest and Iterative procedures
Maximum sum of subarray
- 题目描述：给定一个数组a[0,...,n-1],求其最大子数组(长度>=1)和 输入描述：第一行一个整数n(1<=n<=5000)，然后依次输入n个整数（每个整数范围[-5000, 5000]） 输出描述：输出一个整数表示最大子数组和 样例输入：5 1 -1 1 1 -1 样例输出：2(Topic descr iption:Given an array a[0,..., n-1], find its maximum sum of suba
分治法求最大子数组以及其对应的下标
- 分治法应用分治法求最大子数组以及其对应的下标分治法求最大子数组以及其对应的下标(Application of divide and conquer therapy)