搜索资源列表
DEMO(sort)
- 实现各种内部排序。包括冒泡排序,直接插入排序,Shell排序,快速排序,堆排序,并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.
5 sort algorithms.txt
- 5 sort routins: Simple Selection Sort, HEAPSORT Insertion Sort, Hill sort, Bubble Sort, Quick sort
sort.rar
- 由C++实现的各种排序算法,包括直接插入排序、希尔排序、冒泡排序、快速排序、选择排序等,By the C++ to achieve a variety of sorting algorithms, including the direct insertion sort, Hill sort, bubble sort, quick sort, selection sort, etc.
Sort
- VC实现。各种排序算法,插入排序,选择排序,交换排序,快速排序,希尔排序,归并排序等。-VC implementation. Various sorting algorithms, insertion sort, selection sort, exchange sort, quick sort, Hill sort, merge sort and so on.
ssort
- 数据结构中的各种排序算法,包括快速排序,堆排序等。是经过精简的程序-data structure of the various sorting algorithms, including Quick Sort stacked ranking. Yes streamlined procedures
sort
- 自己编写的排序算法的代码,有桶排序,计数排序,基数排序,归并排序,堆排序,插入排序,快速排序,选择排序。-Sorting algorithm I have written the code, there are barrels of sorting, counting sort, Radix Sort, Merge Sort, Heap Sort, Insertion Sort, Quick Sort, select Sort.
sort
- 用 插入排序 堆排序 归并排序 快速排序 对1000000个0到2000000的整数进行排序 对文件进行划分后排序-Insertion Sort by HEAPSORT Merging Sort Quick Sort of 1,000,000 0-2000000 integer sort of documents classified after the sort
hyperQsort
- it s a c++ code for hyper quick sort
quick.sort.doc.pdf.tar
- A doc about comparing normal quick-sort algorithms and others.
Quick-sort
- 快速排序,从长度为N 的无序整数序列中提取第k小的元素。-Quick sort, from the length of the disorder for the N extracted sequence of integers k-small elements.
Quick-Sort
- 快速排序(Quicksort)是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是:通过一趟排序将要排序的数据分割成独立的两部分,其中一部分的所有数据都比另外一部分的所有数据都要小,然后再按此方法对这两部分数据分别进行快速排序,整个排序过程可以递归进行,以此达到整个数据变成有序序列。 -Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. Th
quick-sort
- 递归式快速排序代码。没有大小限制,最大限度加速-Recursive quick sort code. No size limit, the maximum acceleration
quick-sort-algorithm
- 数据结构实验报告 快速排序的完整版算法-Experimental data structure reports the full version of quick sort algorithm
Quick-Sort
- 自己编写的关于快速排序和冒泡排序算法的效率比较,有相关的实现,供大家参考-I have written about the efficiency of the quick sort and bubble sort algorithm, related to implementation, for your reference
Quick-sort
- 快速排序,随机生成500个随机数,并用快速排序对这500个随机数进行排序。-Quick sort, randomly generated 500 random numbers, and sort these 500 random numbers using quick sort.
quick-sort
- 用户输入一堆毫无顺序的数,通过快速排序算法实现数据的有序排序-quick sort
With-partition-method-of-quick-sort
- 快速排序的主要思想:找出数组的第一个数字作为参照物,从数组第一个数字往后开始比较,同时,从数组最后一个数字往前比较,如果前面的数字比参照值大,找出来,后面的数字比参照值小找出来,他们相互交换位置,当他们相遇了,停止。这样的结果是,相遇点的前面的数字都是比参照值小的,相遇点后面的值都是比参照值大,然后再相遇点分割成两块,各自进行刚才的操作。-The main idea of the quick sort: find the first number as a reference, the arra
random-quick-sort
- 本程序是数据结构中随机快速排序的实现,该算法能在较短的时间复杂度中实现排序。-This program is a data structure in random quick sort of realization, the algorithm can achieve the sort of complexity in a short time in.
quick-sort-and-random-quick-sort
- 实现了普通快速排序和随机快速排序,快速排序采用《算法导论》第三版中给出的算法实现。-To achieve a common fast sort and random quick sort, quick sort using the algorithm Introduction in the third edition of the algorithm is given.
quick
- 通过Java实现用快速排序并附带algs4包,他是一个很有用的例子(Through the Java implementation with a quick sort and with algs4 package, he is a very useful example)