搜索资源列表
ClosetPairs
- 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the probl
sort
- 能够实现起泡法，二分法，堆排序，插入排序，选择排序，快速排序六种方法对100个数进行排序的时间空间复杂度进行比较-To achieve foaming method, dichotomy, Heap Sort, Insertion Sort, Selection Sort, Quick Sort six methods on 100 the number of sort of time and space complexity comparison
sort
- 通过一组相同的数据，对六种不同排序方法（冒泡排序、快速排序、直接插入排序、希尔排序、简单选择排序、堆排序、二路归并排序）的数据元素的比较和移动的次数做一个比较，并对结果作出简单分析-Through a group of the same data, sort of six different methods (bubble sort, quick sort, direct insertion sort, Hill sort, simple selection sort HEAPSORT, Roa
sortVC
- vc++6.0写的排序软件，实现了对字符、字符串的排序，对文件夹中的文件按文件名、文件大小以及最近修改时间的排序。用户可以根据自己的需求在软件的首界面选择要排序的方式。-vc++ 6.0 to write the sort of software to realize the characters, the sort string for files in that folder by file name, file size and modification time of the sort
bucketSort
- （吊桶排序法）吊桶排序法源于一维正整数数组的排序问题，它使用了一个行从下标从0-9，列下标从0-n-1（n是一维数组中的元素数目）的二维整数数组，二维数组的每一行叫做一个吊桶（bucket）。-(Bucket sorting method) bucket sort method from the one-dimensional array of positive integer scheduling problem, it uses a line from the subscr ipt from
sort
- 各种排序功能的实现和时间比较，同时用户可以自定义数据实现排序功能.-The realization of the various sort functions and time, while users can customize the data to achieve sorting function.
Sort
- 快速排序问题，利用快速排序的原理给输入的一组数据进行排序-Express scheduling problem, using the principle of quick sort to enter one set of data to sort
Sort
- 几种排序和评价，快速排序等，有具体的时间比较！-And evaluation of some sort, quick sort and so on, have a specific time!
sort
- 设计一个Visual C++程序实现几种排序方法，要求输入一组数组之后，可以算出其几种排序的结果，即，依次为：直接插入排序，希尔排序，冒泡排序，快速排序，简单选择排序，堆排序，归并排序。 -To design a Visual C++ procedures for implementation of several sorting methods, for the importation of a group of the array, you can calculate the n
sort
- 各种排序方法源码，快速、归并、基数、希尔等排序-sort source codes
united1
- openmp sort, parallel bubble sort for example
sort
- 奇偶交换排序，实现排序的方法之一，根据其中的奇数偶数来定-Sort parity exchange, one of the ways to achieve the sort, according to which even the odd set
sort
- Idon tkonow,you know-sort
Sort
- 对一组数据实现排序，采用冒泡法，选择法，双向冒泡法等-The realization of a set of data to sort using bubble law, choice of law, such as bi-directional Bubble Act
sort
- 冒泡，快速，插入，选择等排序的性能比较。。可以在随机生成1到10000个数做为排序源。。然后执行5种排序。得到移动次数和比较次数-Bubble, quick, insert, select, such as sort of performance comparison. . Can be randomly generated number 1-10000 sort as the source. . And then the implementation of five kinds of sort
Map22
- 有向无环图是描述一项工程进行过程的有效工具,主要进行拓扑排序和关键路径的操作。构建了有向无环图的一系列操作的实现.-Directed acyclic graph to describe the process of a project carried out an effective tool, mainly for topological sort and the operation of the critical path. Construction of a directed acycli
sort
- 实现了各种方法排序，如插入，希尔，快排，选择，和归并，以及这几种排序时间统计及比较-Order to achieve a variety of methods, such as insert, Hill, fast scheduling, selection, and merging, as well as time to sort these types of statistics and comparison
sort
- 实现“选择、插入、归并、合并 && 快速”五种排序-The realization of " select, insert, merging, merger & & fast" sort of five
QuickSort_20090320
- quick sort 快速排序 quick sorting a number-quick sort , quick sorting a number
2D-array-sort
- 对2维数组中，指定的列进行排序。 可以对数值、字符进行排序。可以控制正序或倒序排序。 Labview v2010-On 2-dimensional array, specify the sort column. Can values, characters are sorted. Can control the positive sequence or reverse order. Labview v2010