CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - heap sort
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Games
SDK
Other
Search - heap sort - List
[
Other resource
]
数据结构中所用的8种排序方法
DL : 0
本程序集合了数据结构8种主要的排序方法:插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.
Date
: 2008-10-13
Size
: 76.72kb
User
:
吴晓辉
[
Other resource
]
排序算法-java
DL : 0
用java实现的数据结构排序算法,包括:选择排序、插入排序、冒泡排序、希尔排序、快速排序、堆排序、归并排序。-used to achieve the ranking algorithm data structure, including : Select, in order of insertion sequence and Bubble Sort, Hill sequencing, rapid sequencing, heap sort, merging sequencing.
Date
: 2008-10-13
Size
: 52.96kb
User
:
陈为
[
Other resource
]
huffman_f
DL : 0
huffman_f 在huffman_e的基础上,将排序改为利用堆排序原理选择最小的两个权值。也即,将所有元素的权值组织成堆后,每次堆内的根结点就是最小值了。每取出一个根结点后,就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后,再把子树作为叶子结点放到堆中,并让其上升到合适的位置,保持堆性质不变。因为每次不必完成整个排序过程,而只是组织成堆,因此,这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现,见http://www.cs.mu.oz.au/mg-huffman_f in huffman_e, on the basis of order to use Heap Sort tenets of the two smallest choose the right values. That is, all the elements of the weights organizations piles, each pile of Root is a minimum. Root out every one after, they pile tail elements transferred Root reconstruction reactor. Two out minimum son into a tree, then the tree-leaf nodes as into rubble, and allowed to rise to a suitable location, to maintain the nature of sculpture. Because each time without complete the entire sequencing process, and the only organization piles, therefore, this method than using the rapid sequencing faster. Reference to the above algorithm mg-1.2.1 Huffman coding to achieve, see http://www.cs.mu.oz.au/mg
Date
: 2008-10-13
Size
: 2.15kb
User
:
真实
[
Other resource
]
排序和查找
DL : 0
常用的数据结构排序和查找算法:简单选择排序,冒泡排序,折半插入排序,快速排序,堆排序 顺序查找,折半查找.-commonly used data structures sorting and searching algorithms : simple choice, in order of Bubble Sort, half insertion sort, rapid sequencing, Heap Sort sequence search, binary search.
Date
: 2008-10-13
Size
: 2.52kb
User
:
张杰
[
Other resource
]
all_kinds_of_algorithms
DL : 0
常用算法如西尔排序 堆排序 冒泡排序 选择排序等-common algorithms such as Silvan ranking Heap Sort Bubble Sort Selection Sorting etc.
Date
: 2008-10-13
Size
: 2.78kb
User
:
jiangyi
[
Other resource
]
SortArithmetic
DL : 0
学习数据结构写的排序代码,有冒泡排序、直接插入、希尔排序、简单选择排序、快速排序、堆排序-study data structure was sort of code, Bubble Sort directly inserted, Hill, in order of simple choice, in order of Quick Sort, Heap Sort
Date
: 2008-10-13
Size
: 125.79kb
User
:
陈飞
[
Other resource
]
DEMO(sort)
DL : 0
实现各种内部排序。包括冒泡排序,直接插入排序,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.
Date
: 2008-10-13
Size
: 10.54kb
User
:
张某某
[
Other resource
]
priority_queues
DL : 0
是个HEAP SORT 算法..对一个数列进行HEAP SORT -is SORT algorithm Rd .. right for a series Rd SORT
Date
: 2008-10-13
Size
: 1.06kb
User
:
朱雨科
[
Other resource
]
Delphi_1016
DL : 0
《Delphi算法与数据结构》源码 Delphi开发人员Julian Bucknall从实用角度为广大程序员提供了有关使用算法和数据结构的一个详尽的介绍。Bucknall先从算法性能的讨论开始,涵盖了诸如数组、链表和二叉树等内容。这本书强调了查找算法(如顺序和二分查找),另外也重点介绍了排序算法(包括冒泡排序、插入排序、希尔排序、快速排序和堆排序),此外还提供了有关的优化技术。不仅如此,作者还介绍了散列和散列表、优先队列、状态机和正则表达式以及诸如哈夫曼和LZ77等数据压缩技术。 随附光盘中有作者所开发的一个相当成功的自由软件库EZDSL,另外还有可运行于各版本Delphi上和Kylix上的源代码,此外还提供了TurboPower Software公司的可执行程序。-"Delphi algorithm and data structure" Delphi source developers Julian Buch knall from a practical standpoint the majority of programmers for the use of the algorithm and data structure of a detailed presentation. Bucknall start with the performance of the algorithm outset of the discussion, covering such as arrays, linked lists and binary trees, and other content. This book stresses the search algorithm (such as the sequence and identify two hours), It also focuses on the sorting algorithm (including bubble sort, insertion sort, Hill, ranked Quick Sort and Heap Sort) It also provided the optimization technology. Moreover, the author also introduced the hash and hash table, the priority queue, and the state machine and regular expression such as Huffman and LZ77 data compression t
Date
: 2008-10-13
Size
: 145.17kb
User
:
Bob
[
Other resource
]
JavaSortingMethod
DL : 0
java 排序,冒泡排序,快速排序,选择排序,插入排序,堆排序,归并排序等等!-java ranking, bubble sort, quick sort, select Sort, insert sequencing, heap sort, merge sort, and so on!
Date
: 2008-10-13
Size
: 6.61kb
User
:
丁如敏
[
Other resource
]
06Heapsort
DL : 0
heapsort,堆排序,很少有人介绍,可是却是一种基本的算法-heapsort, heap sort, there are very few people on, but they are a basic algorithm
Date
: 2008-10-13
Size
: 332.77kb
User
:
billkim
[
Other resource
]
heapArrange
DL : 0
此程序实现了堆排序,并且使用了MFC的图形界面,非常实用-this program achieved a heap sort, and the use of the MFC graphics interface, very useful
Date
: 2008-10-13
Size
: 55.17kb
User
:
林林
[
Other resource
]
Sort_Demo
DL : 0
*一个简单的能够形象演示各种排序算法的applet小程序 *类似于Sun公司的示例程序,但比它复杂 *因为这个程序支持简单选择排序,冒泡排序,双向冒泡, *快速排序,希尔排序,堆排序,归并排序共七种排序算法 *每次80个整数随机生成,七种算法同时运行,之间的对比非常明显-* a simple image can be demonstrated by various sort algorithm small applet procedures similar to the Sun Public * Secretary of the sample program, but complex than it is because of this procedure * support a simple choice of sequencing, bubble sort, and two-way Bubble, * Quick Sort, Hill sequencing, heap sort, merging a total of seven Sorting Algorithm * 80 each integer random generation, Seven algorithm running, the contrast between the very obvious
Date
: 2008-10-13
Size
: 42.64kb
User
:
徐阳
[
Other resource
]
newrank
DL : 0
这是用VC++做的一个堆排序的程序,非常适合用作数据结构的课程设计。有默认的输入,并且可以生成树型结构。-This is done with the VC heap sort of a procedure, very suitable for the data structure used for the design. Is the default input, and generate the tree structure.
Date
: 2008-10-13
Size
: 38.16kb
User
:
zzl
[
Other resource
]
HEAPSORT
DL : 0
堆排序算法的C语言的源程序代码 (source code written in C programming language for algorithm of heap sort).
Date
: 2008-10-13
Size
: 1002byte
User
:
吴明
[
Other resource
]
电话本管理系统
DL : 0
提高输入容错。判断输入的对错。 时间关系,搜索功能为线性搜索,现增强如下:f_search:费氏查找法;btree:二叉树查找法;l_search:线性查找法; r_search:递归折半查找法;zcsear:杂凑碰撞查找法;o_sear:插补查找加强法; 排序是冒泡法,现增强为:heaps:累堆排序;binary:二叉树排序;xieer:谢耳排序;sinsert:插入排序;quicks:快速排序;select:选择排序法;-increase input fault tolerance. Imported wrong judgment. The time, a search function for the linear search is enhanced as follows : f_search : Fernandez search method; BTREE : binary tree search method; L_search : linear search method; R_search : recursive binary search method; Zcsear : hash collision search method; " Files : interpolation search Enhancement Act; Sorting is bubbling, as it is now : heaps : tired heap sort; binary : Binary Tree sorting; xieer : Xie ears scheduling; sinsert : Insert scheduling; quicks : rapid sequencing; select : Select Sort;
Date
: 2008-10-13
Size
: 4.68kb
User
:
王军
[
Other resource
]
各种排序比较
DL : 0
分别实现直接插入排序、冒泡排序、简单选择排序、希尔排序、快速排序、堆排序,并随机生成30个数,比较各算法的时、空性能和稳定性。-respectively direct insertion sort, bubble sort, simple choice, in order of ranking Hill, the quick sort, heap sort, and Random Number Generation 30, a comparison algorithm, the performance and stability of the air.
Date
: 2008-10-13
Size
: 8.43kb
User
:
李景良
[
Other resource
]
ds_kcsj_cxc
DL : 0
《数据结构》排序演示系统。实现6种内部排序。包括直接插入排序,希尔排序,冒泡排序,直接选择排序,快速排序,堆排序。。这是我的数据结构课程设计!-"data structure" Sort demonstration system. Six species of achieving internal order. Including direct insertion sort, Hill, in order Bubble Sort, direct selection, in order of Quick Sort, heap sort. . This is my data structure course design!
Date
: 2008-10-13
Size
: 314.1kb
User
:
程相闯
[
Other resource
]
排序程序
DL : 0
利用C语言实现,8种排序算法! 例如:插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序!-using C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!
Date
: 2008-10-13
Size
: 3.02kb
User
:
叶兆源
[
Other resource
]
内部排序的主要算法及相关可实现程序
DL : 0
内部排序的所有算法,而且有相关可执行例子,包括插入排序,选择排序,希尔排序,快速排序,堆排序,归并排序等,很全,很孀。-sequencing of all internal algorithm, but is related to the executable examples, including insertion sort, select, in order of ranking Hill, the quick sort, heap sort, merging sequencing, all very, very widow.
Date
: 2008-10-13
Size
: 13.13kb
User
:
李雷
«
1
2
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.