搜索资源列表
AlgorithmCode
- C++版本的各类算法源代码,包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
Quicksort
- 基于分治算法的快速排序。编程工具vc++6.0.时间复杂度O(nlogn)-Divide and Conquer Algorithm Quicksort
Mergesort
- 归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。 -Merge sort merge operation is based on an efficient sorting algorithm. This method used divide and conquer (Divide and Conquer) a very typical applications.
project2
- 用c语言做分治法之循环赛日程表,由于水平有限,我不知道错在哪里?请指教!-With the c language to divide and conquer the round-robin schedule, due to limited, I do not know wrong? Please advise!
Cpp1
- 该程序用格雷码来生成组合数序列,它比一般的方法要快-Divide and conquer method to construct the Gray code
ggzxl
- 分治法的基本思想是将一个规模为n的问题分解为k个规模较小的子问题,这些子问题互相独立且与原问题相同。递归地解这些子问题,然后将各个子问题的解合并得到原问题的解。-The basic idea of divide and conquer method is a problem of size n divided into k sub-problems of smaller, these sub-problems independent of each other and with the same
ChessBoard
- 分治法解决棋盘覆盖问题,采用MFC界面实现棋盘覆盖问题的直观描述-Divide and conquer method to solve the coverage problem board, using MFC interface to achieve a visual descr iption of the board covering problem
AccPoint
- Points Allot for conquer 2.0
linear
- Recursive divide and conquer algorithm with linear time selection
6
- 设计程序利用分治策略求n个数的最大值和最小值。-Divide and conquer strategy design process using the number n find the maximum and minimum.
2
- 利用分治策略,在n个不同元素中找出第k个最小元素。-Using divide and conquer strategy, to find n different elements in the first k-smallest element.
algorithm2
- 最大子段和/三种方法/c++语言/(内有报告) 蛮力法,动态规划法,分治法。 可比较时间,随机输入数据...... -The largest sub-segment and/three methods/c++ language/(within report) brute force method, dynamic programming, divide and conquer. Comparable time, the random input data ......
computational-geometry(DengJunHui)
- 邓俊辉老师的计算几何,相信大家都不陌生,里面讲解了很多经典算法,比如分治算法,平面扫描算法,随机算法...相信对研究图形处理方面的人绝对会非常有用-Deng Junhui computational geometry teacher, I believe that everyone is familiar with, which explains a lot of classical algorithms such as divide and conquer algorithm, plane s
Quick-sort
- Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists. The steps are: Pick an element, called a pivot, from the list. Reorder the list so that all elements with values less than the pivot come before the
2.2
- 2.2、线性时间选择(分治策略) 实验数据:input.txt(共100个数据) ——要求找出序列中最小的元素 将最小元素输出到output.txt文件中 -2.2, linear time selection (divide and conquer strategy) experimental data: input.txt (a total of 100 data)- the minimum required to identify sequence elements in
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
Chessboard
- 本程序生成一个n*n的棋盘,n是2的幂,用一个分治算法,用一个L型条块去覆盖除一个指定方块外的所有方格。 如n=2,则有4个方格,其中3个能被一个L型覆盖,N=4,有16个方格,其中15个方格被5个L条型覆盖。 结果中每一个L条形用3对坐标表示-This procedure generates a n* n chessboard, n is a power of 2, with a divide and conquer algorithm, with an L-slice to a sp
divide
- divide and conquer to find maximum subarray and index
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<
Demo
- 用netbeans写的swing程序,写了非递归求两整数最大公因子、分治法求大整数乘法、动态规划求最长公共子串,集合划分问题。 -Netbeans swing with written procedures, write a non recursive find the greatest common factor of two integers, divide and conquer seek large integer multiplication, dynamic programming