搜索资源列表
quickSort
- 基于分治法的快速排序方法,C语言实现方法。-Quick sort
Cpp-1
- 可以进行快速排序,对给出的一列数字进行快速的排序-Can be a quick sort, a column of the given number of quick sort
Demo
- 数据结构中快速排序的代码实现。快速排序的平均时间复杂度为 log2n,-Data structure in the quick sort code. The average time complexity of the quick sort log2n,
paixu
- 各种各样的排序,插入排序,交换排序,快速排序,选择排序等待,这个只是部分函数-A variety of sort, insertion sort, sort, quick sort exchange, choose Sort
QuickSort
- 快速排序是对冒泡排序的一种改进,整个排序的过程以递归的方式进行,是一种非常有效的排序方式。-Quick Sort Bubble Sort is an improvement, the entire sorting process in a recursive manner, is a very effective sort.
QuickSort_p88
- 快速排序。修订了教课书上程序代码的不足。提供了完成的调试方案-quick sort
src
- java排序算法,集成快速排序,直接插入排序,直接选择排序,快速排序,堆排序等常见排序算法,通过泛型和java8的函数式接口,可以支持针对任何数据类型的升序和降序排序-Java sorting algorithm, integrated quick sort, direct insertion sort, selection sort, quick sort, heap sort common sorting algorithm, through the functional interface
Algorithm-Introduction-Experiment
- 中科大软件学院算法导论实验源代码,包括0-1背包问题、快速排序、贪心算法等问题。-this pack of code includes 0-1 knapsack problem, quick sort, greedy algorithm and other issues
KITBAG
- 背包问题是用贪心算法得到最优解得一个典型问题。背包问题具有最优子结构性质首先通过快速排序算法对物品按照单价从大到小排序,然后进行贪心选择。-Knapsack problem is a greedy algorithm with the optimal solution may be a typical problem. Knapsack problem with the nature of the optimal sub-structure, first of all, quick sort a
paixu100
- 各种排序包括快速排序、冒泡排序、选择排序、插入排序-Sort, including a variety of quick sort, bubble sort, selection sort, Insertion Sort
qs
- 快速排序算法的实现,用C写的,在VC6.0下编译通过-quick sort using c
Qsort
- 本算法包括快速排序算法及快速排序的改进算法-The algorithm including the Quick Sort algorithm and Quick Sort Algorithm
quicksort102
- 实现快速排序主要是采用指针的方式来随机产生大量数并排序-The realization of quick sort is the main way to target a large number of randomly generated number and sort
quicksortusage
- 系统自带快速排序用法,含六种不同情况,相当好-Quick Sort own usage of the system, including the six different situations, very good
quikesort
- 一个快速排序的算法及实现过程,也实现了真正排序的过程。-A quick sort algorithm and the realization of the process, but also the realization of a real process of sorting.
QuickSort
- c++代码,实现快速排序,代码中有数组和向量两种代码实现-c++ code, quick sort, using vector arrays and two ways
quickSort
- Quick sort algo. which use pivot to sort a list of elements in efficient manner
sort101
- 本程序依次生成10个随即数组,然后分别用归并排序和快速排序 进行排序,统计两种排序所用时间,在屏幕上打印出来。-This procedure in turn generates an array of 10 immediately, and then were used to sort and quick sort merge sort, statistics used in two kinds of sorting time on the screen print.
Sort103
- 快速排序问题,利用快速排序的原理给输入的一组数据进行排序-Express scheduling problem, using the principle of quick sort to enter one set of data to sort
sort104
- 通过一组相同的数据,对六种不同排序方法(冒泡排序、快速排序、直接插入排序、希尔排序、简单选择排序、堆排序、二路归并排序)的数据元素的比较和移动的次数做一个比较,并对结果作出简单分析-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