Location:
Search - fast heapsort
Search list
Description: 堆排序
稳定的排序
复杂度为N（logN ） 也是一种快速的排序-HEAPSORT stable sort complexity is N (logN) is a fast sorting
Platform: |
Size: 1024 |
Author: 康平 |
Hits:
Description: 这个程序实现的是将一串数字通过堆排序方法进行排序,速度快!-This procedure is to realize a bunch of digital methods to sort through the heap sort, fast!
Platform: |
Size: 126976 |
Author: caoti |
Hits:
Description: 实现各种内部排序，包括：
1、直接插入
2、简单选择
3、快排
4、堆排序
输入待排数字后，菜单选择排序方式，部分排序有主要排序步骤。
-Implementation of various internal sort, including: one, directly into the 2, 3 easy selection, fast row 4, HEAPSORT input figure to be ranked, the menu select Sort by, some sort has major sorting step.
Platform: |
Size: 2048 |
Author: focus |
Hits:
Description: 内容包括用Java实现的数据结构高级算法-The major topics covered include
elementary sorting methods (selection, insertion), searching (sequential, binary), merging, pointers (called references
in Java), linked lists, stacks, queues, recursion, random numbers, files (text, binary, random access, indexed), binary
trees, advanced sorting methods (heapsort, quicksort, mergesort, Shell sort), and hashing (a very fast way to search).
Platform: |
Size: 2438144 |
Author: 谭昭平 |
Hits:
Description: 实现各种内部排序，包括：1、直接插入2、简单选择3、快排4、堆排序输入待排数字后，菜单选择排序方式，部分排序有主要排序步骤。-Implementation of various internal sort, including: one, directly into the 2, 3 easy selection, fast row 4, HEAPSORT input figure to be ranked, the menu Sort by, some sort has major sorting step.
Platform: |
Size: 2048 |
Author: faan6ayo44 |
Hits:
Description: 基数排序
基数排序（radix sort）属于“分配式排序”（distribution sort），又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的稳定性排序法。
快速排序
快速排序由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。
堆排序
堆排序(Heapsort)是指利用堆积树（堆）这种数据结构所设计的一种排序算法，它是选择排序的一种。可以利用数组的特点快速定位指定索引的元素。堆分为大根堆和小根堆，是完全二叉树。大根堆的要求是每个节点的值都不大于其父节点的值，即A[PARENT[i]] >= A[i]。在数组的非降序排序中，需要使用的就是大根堆，因为根据大根堆的要求可知，最大的值一定在堆顶。
求幂
输入xy 求y的x次方的值-Radix sort
Element assignment radix sort (radix sort) are assigned ordering (distribution sort), also known as bucket Law (bucket sort) or bin sort, as the name suggests, it is part of the information through the key will be sorted to some of the barrel in order to achieve the sort of role, radix sort belongs to the sort of stability, its time complexity is O (nlog (r) m), where r is taken to the base, and m is the heap number, at some point, radix sort efficiency than other sort of stability.
Quick Sort
Fast Sorted by C. A. R. Hoare proposed in 1962. Its basic idea is: a trip by ordering the data to be sorted into separate two parts, one part of all of the data than the other portion of all data should be small, then the data in this way for the two parts separately fast sort, the entire sorting process can be recursively in order to achieve the whole data into an ordered sequence.
Heap sort
Heap sort (Heapsort) refers to a sorting algorithm uses stacked tree (h
Platform: |
Size: 3072 |
Author: 贺敏 |
Hits: