搜索资源列表
mergesort11
- 二分搜索是运用分治策略的典型例子。二分搜索方法充分利用了元素间的次序关系,采用分治策略,可在最坏情况下用O(logn)的时间完成搜索任务。-two hours search is to use the divide and conquer strategy is a typical example. Two-search method full use of the elements in the order, using the divide and conquer strategy, in
ClosestNodePairs
- 这是最接近点对问题,分别使用了分治算法和穷举法求解最接近点对。-it is the closest point of the problem, namely the use of a divide-and-conquer method and exhaustive closest point right.
MergeSort2
- 二路合并排序算法,使用分治策略,时间复杂度O(nlog2n), 需要和待排记录等数量的辅助空间,是一种稳定的排序算法-two-way merge sorting algorithm, the use of divide-and-conquer strategy, the time complexity O (nlog2n) Pai and the need to record the number of auxiliary space, is a stable Sort Algorithm
divide and conquer
- 这是一个分治法应用和递归的完美体现,它根据输入的数字在屏幕上打出美丽的图案。-this is a separate rule and the application of recursive the perfect embodiment of its import figures on the screen making beautiful designs.
bc_mfc
- 使用Binomial Cofficient的演算法,並以Divide-and-Conquer以及Dynamic Programming的方式來實作,並以比例尺來做比較-use of the algorithms, and Divide - and-Conquer and Dynamic Programming is the way to make and do more to Scale
dazhengshu
- 本人上传的是用分治法实现的大整数算法,采用的是数组形式。-I uploaded is to use divide and conquer to achieve a large integer arithmetic, using the array form.
1
- 分治算法解士兵站队问题,ACM大学生程序设计题。-Divide and conquer algorithm for solving the soldiers stand in question, ACM Collegiate Programming problem.
mergeSort
- merge sort is a sorting algorithm used for sorting data it uses divide and conquer approach
DataStructureAlgorithm
- 数据结构和算法,非常经典,讲的很详细!第一部分 基础知识 第一章 C++程序设计 第二章 程序性能 第二部分 数据结构 第三章 数据描述 第四章 数组和矩阵 第五章 堆栈 第六章 队列 第七章 跳表和散列 第八章 二叉树和其他树 第九章 优先队列 第十章 竞赛树 第十一章 搜索树 第十二章 图 第三部分 算法设计方法 第十三章 贪婪算法 第十四章 分而治之算法 第十五章 动态规划 第十六章 回
DataStructuresandAlgorithmAnalysis
- 全面系统地介绍了队列、堆栈、树、图等基本数据结构,以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法。-A comprehensive and systematic introduction to the queue, stack, tree, map and other basic data structures, as well as greedy algorithms, divide and conquer algorithms, branch and bound algorith
devide_conquer
- 分治法解最近点对问题:首先输入点的个数,然后输入点的坐标,输出先是根据x的坐标对点进行排序,然后输出最近点对的距离。-Divide and conquer solution of the nearest point of the problem: First, the number of input points, and then enter the coordinates of points, the output first, according to the coordinates of
dbPoint.c
- C语言实现,分治法求平面中任意个点的最近点对和最近距离。-C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
fenshu
- 算法分析中的分书问题,运用分治法解决的经典问题-Analysis of algorithms written in the sub-problem, the use of divide and conquer to solve the classic problem
fenzhifa
- 分治法的应用 将序列A(0:n-1)中元素按照升序排序方法:归并排序和快速排序((1)对于快速排序,主元采用三者A(low),A(high),A((low+high)/2)中其值居中者-Divide and conquer the application of the sequence A (0: n-1) elements in ascending sorted by: Merge sort and quick sort ((a) for Quick Sort, the main elemen
Heapfunction
- 算法分析实验 算法分析变治法 堆排序-Experimental analysis of algorithms analysis of algorithms change conquer Heap Sort
ClosestPt
- 采用分治算法找距离最近的两点,点数按输入给定,随机产生。能达到1000000个点。-use divid and conquer method to find the nearest points.
houka
- Kings^OF^Binary Source File Conquer Online
jingdiansuanfa
- 经典算法+分支限界法+分治法+动态规划+贪心算法+回溯法-Classical branch and bound algorithm+ France+ divide and conquer dynamic programming+++ backtracking greedy algorithm
ChessBoard
- 算法分析与设计中用分治法解决棋盘覆盖问题。-Algorithm Analysis and Design using divide and conquer to solve the problem the board cover.
conquer-and-divide-algorithm
- 本章描述了讲解了分治算法的基本思想和设计过程以及原理-Explain the basic idea and design process as well as the principle of divide and conquer algorithm described in this chapter