Location:
Search - heapsort
Search list
Description: 堆排序的算法,原书带的并不能直接使用,这是本人改的直接可用的-Heap Sort algorithm, the original book and can not be directly used, it is I change direct available
Platform: |
Size: 579584 |
Author: 1111 |
Hits:
Description: Pascal堆排序
标准、最快的堆排序方法（在FreePascal中）-Pascal HEAPSORT standards, HEAPSORT the fastest method (in FreePascal in)
Platform: |
Size: 1024 |
Author: wnjgtogood |
Hits:
Description: 堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子
算法平均时间复杂度: O(nlogn)
-HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)
Platform: |
Size: 1024 |
Author: 朱洁 |
Hits:
Description: 堆排序适合于待排序文件中记录较多的情况，因为其主要的时间开销在于建堆和调整堆-HEAPSORT be suitable for sorting paper records more, because the main overhead is the time to build reactors and adjusting the heap
Platform: |
Size: 1024 |
Author: hjs |
Hits:
Description: 从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。-From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.
Platform: |
Size: 1024 |
Author: 溺所至 |
Hits:
Description: 最大堆的生成、堆排序，以及一个简单的最大优先队列的实现。-The largest generation heap, heap sort, as well as a simple realization of the greatest priority queue.
Platform: |
Size: 4096 |
Author: crazy |
Hits:
Description: Heapsort
1.A heap is a binary tree satisfying the followingconditions:
-This tree is completely balanced.
-If the height of this binary tree is h, then leaves can be at level h or level h-1.
-All leaves at level h are as far to the left as possible.
-The data associated with all descendants of a node are smaller than the datum associated with this node.
Implementation
1.using a linear array not a binary tree.
-The sons of A(h) are A(2h) and A(2h+1).
2.time complexity: O(n log n)
Platform: |
Size: 196608 |
Author: 黃文岩 |
Hits:
Description: 堆排序的C语言实现,使用Visual C++2008完成。-heapsort-C
Platform: |
Size: 603136 |
Author: guozi |
Hits:
Description: 此文件夹中共包括十二个小程序
AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除
Boyer_Moore算法的串模式匹配
Horspool算法的串模式匹配
Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历
HeapSort利用堆排序实现优先级队列
Merge实现二路归并排序算法
MFK动态规划解背包问题
nqueue求解n皇后问题
QuickSort快速排序算法的实现。
Shell排序算法的实现。
Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。
tubao用递归法解决突包问题-This folder, including the Chinese Communist AVL applet 12 to create a balanced binary tree, by adding a node to create, and achieving a balanced binary tree of nodes to delete Boyer_Moore algorithm Horspool string pattern matching the string pattern-matching algorithm Graph to achieve a directed graph breadth-first traversal non-recursive and non-recursive depth-first traversal HEAPSORT HeapSort use to achieve the realization of priority queue Merge merge sorting algorithm Road MFK knapsack problem dynamic programming solution of n queen problem solving nqueue rapid QuickSort sort algorithm. Shell Sort Algorithm. Tree process sequence to achieve the first \ in the sequence \ after the sequence of the non-recursive binary tree traversal algorithm. tubao recursive method used to solve the issue of sudden package
Platform: |
Size: 374784 |
Author: zouyan |
Hits:
Description: 堆排序算法C++源码，包括构建初始堆，修复对-Heap Sort Algorithm C++ source code, including the construction of the initial heap, repair of
Platform: |
Size: 136192 |
Author: free |
Hits:
Description: this heapsort program in use C language-this is heapsort program in use C language
Platform: |
Size: 2048 |
Author: jang hak beom |
Hits:
Description: 利用窗体实现堆排序。并能逐一显示堆排序的过程-Using the form to achieve Heap Sort
Platform: |
Size: 84992 |
Author: kaxium |
Hits:
Description: This heapsort coded in C++ template languages, also only used in matlab.-This is heapsort coded in C++ template languages, also only used in matlab.
Platform: |
Size: 1024 |
Author: ohmygotta |
Hits:
Description: 微分方程组中方程的个数，是解决排列数问题的。-Differential equations in the number of equations to solve arranged a few problems.
Platform: |
Size: 1024 |
Author: 张佐 |
Hits:
Description: This program creates a heap from a series of values and then displays the heap before and after using HeapSort.
Platform: |
Size: 1024 |
Author: Ron |
Hits:
Description: Heap 排序法
Heap 排序法
-Heap 排序法
Heap 排序法
Heap 排序法
Heap 排序法
Heap 排序法
Heap 排序法
Platform: |
Size: 132096 |
Author: 刘峰 |
Hits:
Description: 用java实现的堆排序的小程序，能够进行快速排序。-a heapsort programming with java.
Platform: |
Size: 1024 |
Author: tangyuanhua |
Hits:
Description: heapsort堆排序的演示程序,本程序利用C语言编程，图形显示时利用了UCDOS的图形api-this program demonstrate how work of heapsort
Platform: |
Size: 38912 |
Author: hym |
Hits:
Description: 从键盘输入以整数序列，采用堆排序算法对该序列进行排序，并输出排序后的结果。-Sequence from the keyboard input to an integer using the heap sort algorithm to sort the sequence, and outputs the sorted results.
Platform: |
Size: 1024 |
Author: 小王珊珊 |
Hits:
Description: heapsort written in ML language
Platform: |
Size: 1024 |
Author: Jenny Liu |
Hits:
«
1
23
4
5
6
7
8
9
10
...
14
»