Location:
Search - heap
Search list
Description: 堆排序算法的实现,不错的哦-heap sorting algorithm to achieve good oh
Platform: |
Size: 5120 |
Author: qi |
Hits:
Description: 《数据结构》排序演示系统。实现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!
Platform: |
Size: 321536 |
Author: 程相闯 |
Hits:
Description: 主要是详细的介绍堆和栈的本质区别 ，加深理解-Mainly detailed introduction to the essential difference of the heap and stack, and a deeper understanding
Platform: |
Size: 7168 |
Author: Dram |
Hits:
Description: 用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.
Platform: |
Size: 54272 |
Author: 陈为 |
Hits:
Description: 堆和栈的区别
一、预备知识—程序的内存分配
一个由c/C++编译的程序占用的内存分为以下几个部分
1、栈区（stack）— 由编译器自动分配释放 ，存放函数的参数值，局部变量的值等。其操作方式类似于数据结构中的栈。
2、堆区（heap） — 一般由程序员分配释放， 若程序员不释放，程序结束时可能由OS回收 。注意它与数据结构中的堆是两回事，分配方式倒是类似于链表，呵呵。
3、全局区（静态区）（static）—，全局变量和静态变量的存储是放在一块的，初始化的全局变量和静态变量在一块区域， 未初始化的全局变量和未初始化的静态变量在相邻的另一块区域。 - 程序结束后有系统释放
4、文字常量区—常量字符串就是放在这里的。 程序结束后由系统释放
5、程序代码区—存放函数体的二进制代码。
二、例子程序
-reactors and the distinction between a stack, prior knowledge-memory allocation procedures from a c/C compiler procedures occupied by the memory is divided into the following sections 1, Stack (stack)- automatically by the compiler release distribution, storage function parameters, local variables, such as the value. Their mode of operation similar to the data structure of the stack. 2, the reactor (heap)- General to release the allocation by programmers, programmers if not released at the end of proceedings by the OS may recall. Attention to its data structure and the reactor are two different things, but similar to the distribution chain, Ha ha. 3, the overall situation (static) (static)-, global variables and static variables are stored on one, initialize the global variables and s
Platform: |
Size: 14336 |
Author: stevephen |
Hits:
Description: 斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上，进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作-Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the basis of further to the O (1) to achieve specified nodes and reduce the value of O (log n) time to complete the deletion of arbitrary nodes parade for
Platform: |
Size: 3072 |
Author: wt |
Hits:
Description: 本程序完成实验要求的全部功能直接插入排序、SHELL排序、冒泡排序、快速排序、简单选择排序、堆排序、归并排序、基数排序，程序代码符合书写规范，实验报告叙述清晰完整，有详尽的分析和总结。
在实验过程中，积极配合本团队分工合作的精神，努力学习，总算不负众望，将程序编好，在此，我更想感谢的是老师的教导，在她的帮助下，我才顺利完成了本次的任务。
-the experimental procedures are completed all the functional requirements of the direct insertion sort, Shell sort, bubble sort, Quick Sort, the simple choice of sequencing, heap sort, merge sort, radix sort, code written with norms, Experimental report describes a distinct and comprehensive, detailed analysis and summary. In the course of the experiment, the team actively cooperate with the division of labor, study hard, and finally delivered to the completion of procedures, in this, I also want to thank the teacher is teaching, in her help, I will have completed this task.
Platform: |
Size: 97280 |
Author: 马全 |
Hits:
Description: 内部排序算法比较，6种常用的内部排序算法进行实测比较:一趟冒泡排序、简单选择排序、快速排序、希尔排序、直接插入排序、堆排序。-internal sorting algorithm, six kinds of internal sorting algorithm measured comparison : Bubble Sort trip, Sort simple choice, quick sort, Hill, ranked direct insertion sort, heap sort.
Platform: |
Size: 1284096 |
Author: 马全 |
Hits:
Description: heapsort，堆排序，很少有人介绍，可是却是一种基本的算法-heapsort, heap sort, there are very few people on, but they are a basic algorithm
Platform: |
Size: 340992 |
Author: billkim |
Hits:
Description: Dijkstra算法，Heap优化，复杂度NlogN-Dijkstra algorithm, Heap optimization, complexity NlogN
Platform: |
Size: 1024 |
Author: byron |
Hits:
Description: 算法中的堆排序算法的实现-algorithm Heap Sort algorithm.
Platform: |
Size: 9216 |
Author: 张应 |
Hits:
Description: 许多的排序算法，包括选择排序，堆排序，冒泡排序，折半排序，用java开发。-many of the sorting algorithm, including the option of scheduling, heap sort, Bubble sort, half ranking with java development.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 用C#写的堆排序，根据c语言数据结构所讲知识编写-written in C# Heap Sort, c language data structures are prepared to impart knowledge
Platform: |
Size: 22528 |
Author: zhangxh |
Hits:
Description: 内部排序算法比较
一、需求分析
1． 实验要对以下6种常用的内部排序算法进行实测比较：起泡，直接插入，简单选择，快速，希尔，堆排序。
2． 待排序表的表长不小于100，其中的数据要用伪随机数产生（RAND（）），至少要用5组不现的输入数据作比较，比较的指标为有关键字参加的比较次数和关键字参加的比较次数和关键字的移动次数。
3． 最后要对结果作出简单分析，包括对各组数据得出结果波动大小的解释。
-internal sorting algorithm 1, a demand analysis. Experiment on the following six kinds of internal sorting algorithm measured comparison : foaming, direct insertion, simple choice, rapid, Hill, Heap Sort. 2. Sorting tables to the long table is not less than 100, which use the data generated pseudo-random number (RAND ()), be at least five sets of input data are provided for comparison. comparable indicators for the keyword in the number of keywords and the number of participants and the number of mobile keyword. 3. Finally, the results of a simple analysis, including data on the outcome of fluctuations in the size of explanation.
Platform: |
Size: 45056 |
Author: 苏言暖 |
Hits:
Description: 堆与栈有什么区别,预备知识—程序的内存分配-程序的内存分配-Heap and stack What is the difference between the preparation of knowledge- the memory allocation procedures- procedures for memory allocation
Platform: |
Size: 3072 |
Author: draw |
Hits:
Description: Matlab编程使用的电子书籍，希望能给与大家帮助！-Use Matlab to meet the most cavity changchu email抎kill ㄛ洷咡Xikui wrestle迵submerged mode heap翑ㄐ
Platform: |
Size: 2009088 |
Author: Lisa |
Hits:
Description: 選擇排序法的概念簡單，每次從未排序部份選一最小值，插入已排序部份的後端，其時間主要花費於在整個未排序部份尋找最小值，如果能讓搜尋最小值的方式加快，選擇排序法的速率也就可以加快，Heap排序法讓搜尋的路徑由樹根至最後一個樹葉，而不是整個未排序部份，因而稱之為改良的選擇排序法。-Select sort method simple in concept, each part of the election has never been one to sort the minimum, insert has some sort of back-end, spent their time mainly in the unsorted part of the whole search for the minimum, if allowed to search for the minimum value of ways to speed up, select the sort method can also speed up the rate, Heap sort method so that the search path from the root to the last one leaves, not the whole part of unsorted and thus referred to as the choice of ordering method improved.
Platform: |
Size: 4096 |
Author: 王凌云 |
Hits:
Description: 堆排序算法的C语言的源程序代码
(source code written in C programming language for algorithm of heap sort).-Heap Sort Algorithm C language source code (source code written in C programming language for algorithm of heap sort).
Platform: |
Size: 1024 |
Author: 吴明 |
Hits:
Description: This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board.
Platform: |
Size: 19456 |
Author: heavenflames |
Hits:
Description: 快速排序、合并排序、插入排序、堆排序、计数排序等算法的C语言实现-Quick sort, merge sort, Insertion Sort, Heap Sort, Counting Sort algorithm, such as C language
Platform: |
Size: 222208 |
Author: 蔡砚成 |
Hits:
«
1
23
4
5
6
7
8
9
10
...
50
»