Location:
Search - quicksort
Search list
Description: quicksort为一个利用quicksort找数值的方法，一个比较快的搜寻方法
Platform: |
Size: 5441 |
Author: 陳悟 |
Hits:
Description: quicksort的实现 三种写法，主要针对一些边界问题的优化
Platform: |
Size: 623 |
Author: yuegui2@163.com |
Hits:
Description: quicksort为一个利用quicksort找数值的方法，一个比较快的搜寻方法-quicksort use quicksort to find a numerical method, a relatively fast search method
Platform: |
Size: 5120 |
Author: 陳悟 |
Hits:
Description: 快速排序算法的C语言实现，快速排序是经典的排序算法。-Quick Sort Algorithm C language, is the classic quicksort sorting algorithm.
Platform: |
Size: 1024 |
Author: 汪晗 |
Hits:
Description: 迭代快速排序，基本上按照算法书上的算法思想来实现的-Iterative Quicksort basically in accordance with the algorithm book thinking algorithm to achieve the
Platform: |
Size: 111616 |
Author: taolizao |
Hits:
Description: vc++2005编写的快速排序算法,将随机产生的一组数进行排序,学习参考一下,不错的.-vc++2005 prepared Quicksort algorithm, will be a group of randomly generated numbers sorting, refer to study, not bad at all.
Platform: |
Size: 106496 |
Author: 昌隆 |
Hits:
Description: 用非递归实现快速排序
主要思想：
利用栈来消除递归-Non-recursive quicksort implementation the main idea: to eliminate the use of recursive stack
Platform: |
Size: 11264 |
Author: weixiaoguoke |
Hits:
Description: quicksort algorithm implementation
Platform: |
Size: 1024 |
Author: lifeless |
Hits:
Description: quicksort自行取n個數，亂數排序，並檢視程序時間-quicksort to choose their own number n, random number sequencing, and view the program time
Platform: |
Size: 234496 |
Author: kade |
Hits:
Description: 随机生成一组数据，然后用快速排序将生成的数据排序。时间复杂度是O（nLGn）.-QuickSort
Platform: |
Size: 1024 |
Author: 龙龙 |
Hits:
Description: 数据结构的应用之一 快速排序的实例与测试-The application data structure, one of the examples and test quicksort
Platform: |
Size: 4096 |
Author: 杨 |
Hits:
Description: 快速排序
快速排序是一种在含n个数的输入数组上最坏情况运行时间为O（n*n）的算法。
-Quicksort
Platform: |
Size: 3072 |
Author: 有趣 |
Hits:
Description: quicksort implementation java, simple code
Platform: |
Size: 1024 |
Author: galtaash |
Hits:
Description: 快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. Its basic idea is: The trip sorts will want to sort the data split into two independent parts, one part of the part of all of the data than all other data should be small, then part of the data here are two methods for rapid sorting, the sorting process can be recursive, thus achieving the data into an orderly sequence.
Platform: |
Size: 3072 |
Author: 郑阳 |
Hits:
Description: 快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. The basic idea is: sort through the trip sort of data to be split into two independent parts, a part of any data other than the part of all data to be small, then these two methods of data here are fast sorting, the sorting process can be recursive, thus achieving the data into an orderly sequence.
Platform: |
Size: 1024 |
Author: 浩星无恨 |
Hits:
Description: 快速排序的优化算法,在原来快速排序的基础上加入插入排序，使得算法的时间爱你复杂度变低。-QuickSort write in C++
it s the optimization of QuickSort
Platform: |
Size: 1024 |
Author: su |
Hits:
Description: quicksort with threads
Platform: |
Size: 27648 |
Author: Stf |
Hits:
Description: This code is an MPI version of the sorting algorithm QuickSort in c++. The partitioning step is meda sequantially, but the split and merge steps are made using Send and Recieve methods.
Platform: |
Size: 2048 |
Author: saretaxd |
Hits:
Description: 这个文件是一个基于java的quicksort(QuickSort based on java)
Platform: |
Size: 1024 |
Author: 咪啪的喵
|
Hits:
Description: 快速排序(QuickSort)的基本思想和算法(Basic ideas and algorithms for fast sorting (QuickSort))
Platform: |
Size: 10240 |
Author: ne_o
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
34
»