搜索资源列表
quicksort
- 用非递归实现快速排序 主要思想: 利用栈来消除递归-Non-recursive quicksort implementation the main idea: to eliminate the use of recursive stack
quicksort
- 快速排序的实现程序,具有详细的说明,是初学者实用的学习例子-Quick Sort realize procedures, with detailed instructions for beginners are studying practical examples
quicksort
- 实现快速排序 主要是采用指针的方式来随机产生大量数并排序-The realization of quick sort is the main way to target a large number of randomly generated number and sort
paixu
- 归并排序C++程序,快速排序C++程序,可在C++环境中实现的源代码-Merging Sort C++ Procedure quicksort C++ Procedures may C++ Environment source code
QuickSort
- 快速排序法,基于分治策略的一个排序算法 3个步骤1分解,2递归求解,3合并 使用随机划分挑选哨兵,期望划分较对称-Quick Sort law governing strategy based on a sorting algorithm 3 Step 1 decomposition, 2 Recursive Solution, 3 combined divided randomly selected sentinel to expect a more symmetrical divis
quicksort
- 快速SORT,quicksort 以前作业写的-SORT
QuickSort
- 实现了快速排序,还不够20字啊,这怎么行呢 -none
QuickSort
- 这是快速排序算法的完整实现,并有一个测试用例。-This is a complete quick sort algorithm implementation, and there is a test case.
quicksort
- 快速排序算法,非常高效的算法,在计算图形学方面非常有用-Quick sort algorithm, the algorithm is very efficient in the calculation is very useful graphics
QuickSort
- QuickSort implementation in CSharp
quicksort
- 可用此法实现快速分类。It recursively does this until the 2 parts are so small that determining which part goes where becomes a trivial matter. After the vector is split and sorted, they are combined to for the original, in sorted order. -This is a quicksort alg
quicksort
- quicksort algorithm for sorting matrices
quicksort
- use c++ to realize quicksort program whick can sort a num of numbers in a short time
Quicksort
- quicksort algorithm implementation
QuickSort
- 快速排序算法的一种经典实现,用Visual C++9.0实现-Quick Sort Algorithm- classical realization
kuaipai
- 快速排序算法是排序中相对来说比较好的算方法,大家可以看看啊 -Quicksort sorting algorithm is in relatively good balance method, we can look at ah Hehe
quicksort
- 用C语言实现了快速排序算法的非递归实现,方法比较有创意,有需要的可以研究一下-this is a C programme writed by C.
quicksort
- 將資料從小排序到大,若資料長度為n,complexity為log 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. Its b
quicksort
- quicksort with threads