搜索资源列表
quicksort
- Quicksort algorithm in C++.
MPI_QuickSort.并行快速排序算法
- 并行快速排序算法,基于MPI 2.0 c语言实现,注释很清楚明确。,Parallel QuickSort base on MPI 2.0 in C language.
quicksort
- quick sort例子-quick sort example
quicksort
- 此程序是算法快速排序quicksort的迭代形式-This procedure is an iterative algorithm quicksort quicksort form
QuickSort
- 迭代快速排序,基本上按照算法书上的算法思想来实现的-Iterative Quicksort basically in accordance with the algorithm book thinking algorithm to achieve the
quicksort
- 快速排序法- Fast arrangement law
QuickSort
- 用c++写的快速排序算法,从命令行输入数组,调用算法后,返回排序后的数组-With c++ Write quick sort algorithm, from the command line enter the array, called algorithms, return the array after sorting
5428934
- 排序算法平均时间的比较,实现几种排序算法(selectionsort, insertionsort,bottomupsort,quicksort, 堆排序)-The average amount of time sorting algorithm of comparison, the realization of several sorting algorithm (selectionsort, insertionsort, bottomupsort, quicksort, HEAPSORT)
quickSort
- vc++2005编写的快速排序算法,将随机产生的一组数进行排序,学习参考一下,不错的.-vc++2005 prepared Quicksort algorithm, will be a group of randomly generated numbers sorting, refer to study, not bad at all.
QuickSort
- 一个好用的快速排序算法,调试已经通过,排序快速-quick sort code
Sort
- The running time of quicksort can be improved in practice by taking advantage of the fast running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return wi
SortProject
- 各种经典排序算法的C++实现:堆排序,归并排序,桶排序,快排,希尔排序,外部排序。-serval famous sort algorithms: HeapSort, MergeSort, RadixSort, QuickSort, ShellSort, OutSort.
QuickSort
- Quick sort library. Simple implementation in ansi c to quicksort a array
quicksort
- 采用c语言描述,实现快速算法,实现算法的最优化-Using c language to describe, fast algorithm,
QuickSort
- 分治法快速排序使用分治法快速排序分治法快速排序 使用分治法快速排序-Quicksort for fenzhifa,you use youkonowQuicksort for fenzhifa,you use youkonowQuicksort for fenzhifa,you use youkonow
QuickSort
- quicksort自行取n個數,亂數排序,並檢視程序時間-quicksort to choose their own number n, random number sequencing, and view the program time
Quicksort
- 快速排序 快速排序是一种在含n个数的输入数组上最坏情况运行时间为O(n*n)的算法。 -Quicksort
Quicksort
- 快速排序(Quicksort)是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是:通过一趟排序将要排序的数据分割成独立的两部分,其中一部分的所有数据都比另外一部分的所有数据都要小,然后再按此方法对这两部分数据分别进行快速排序,整个排序过程可以递归进行,以此达到整个数据变成有序序列。-Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. The b
QuickSort
- 快速排序的优化算法,在原来快速排序的基础上加入插入排序,使得算法的时间爱你复杂度变低。-QuickSort write in C++ it s the optimization of QuickSort
quicksort
- 快速排序(QuickSort)的基本思想和算法(Basic ideas and algorithms for fast sorting (QuickSort))