Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - heap

Search list

[OS Develop] heap

Description: 简单的内存堆管理，模拟操作系统，实现简单的内存分配和回收。-Simple memory heap management
Platform: | Size: 224256 | Author: Windeal | Hits:

[Data structs] Heap-sort

Description: 堆排序 　堆排序利用了大根堆（或小根堆）堆顶记录的关键字最大（或最小）这一特征，使得在当前无序区中选取最大（或最小）关键字的记录变得简单。 　　（1）用大根堆排序的基本思想 　　① 先将初始文件R[1..n]建成一个大根堆，此堆为初始的无序区 　　② 再将关键字最大的记录R[1]（即堆顶）和无序区的最后一个记录R[n]交换，由此得到新的无序区R[1..n-1]和有序区R[n]，且满足R[1..n-1].keys≤R[n].key 　　③由于交换后新的根R[1]可能违反堆性质，故应将当前无序区R[1..n-1]调整为堆。然后再次将R[1..n-1]中关键字最大的记录R[1]和该区间的最后一个记录R[n-1]交换，由此得到新的无序区R[1..n-2]和有序区R[n-1..n]，且仍满足关系R[1..n-2].keys≤R[n-1..n].keys，同样要将R[1..n-2]调整为堆。 　　…… 　　直到无序区只有一个元素为止。 　　（2）大根堆排序算法的基本操作： 　　① 初始化操作：将R[1..n]构造为初始堆； 　　② 每一趟排序的基本操作：将当前无序区的堆顶记录R[1]和该区间的最后一个记录交换，然后将新的无序区调整为堆（亦称重建堆）。 -Heap sortHeap sort heap sort using the root pile ( or small stack stack top ) the record of the keyword maximum ( or minimum ) of this feature, the present disordered select the maximum (or minimum ) keyword records made simple. ( 1 ) with a large root heap sort of basic ideas of the initial file R[1..N] built a large root pile, the pile as the initial disordered regions of the keywords maximum recorded R[1] (i.e. top ) and disordered regions recorded one of the last R[n] exchange, the new R [1..N-1] and disordered zone ordered region R[n], and satisfy the R[1..N-1].keys≤ R[n].key③due to exchange new root R[1] may violate the heap property, so should be the present disordered R[1..N-1] adjustment for reactor. Then again in the R[1..N-1] keyword best record R[1] and the interval of the last record of a R[n-1] exchange, thus get new disordered and ordered R[1..N-2] R[n-1..N], and still meet the relationship between R[1..N-2].keys≤ R[n-1..N].keys, R[1..N-2] also will adjust for reactor. .
Platform: | Size: 1024 | Author: 周杨 | Hits:

[Other] max-heap

Description: max heap sorce code and it is good
Platform: | Size: 1024 | Author: king | Hits:

[Other] heap-sort

Description: heap sort and it is good
Platform: | Size: 327680 | Author: king | Hits:

[Shell api] Heap-spray

Description: Heap spray经典技术资料 Heap Feng Shui in JavaScript_en_cn.doc bh-eu-07-sotirov-WP.pdf-Heap spray
Platform: | Size: 195584 | Author: cooky | Hits:

[Data structs] binary--heap

Description: 二叉堆的实现 ，可以为数据结构的学习者，提供一个良好的借鉴-Binary heap implementation, provide a good reference for the data structure learners
Platform: | Size: 3072 | Author: 付翔 | Hits:

[Other] Heap

Description: 数据结构中 相对麻烦的堆排序 算法及其 具体的实现 -Data structure relatively trouble heap sort algorithm and its concrete realization
Platform: | Size: 1024 | Author: nanshihui | Hits:

[MultiLanguage] HEAP

Description: Heap method using sort that arrange values
Platform: | Size: 1024 | Author: Bon | Hits:

[Other] min-heap

Description: 数据结构中最小堆生成算法，采用java实现，-The minimum heap generation algorithm using java to achieve
Platform: | Size: 1024 | Author: 黄煜彩 | Hits:

[Data structs] min-heap

Description: 采用C++语言完成的程序设计课程作业，实现最小堆算法，附带演示程序-C++ language program design course to achieve the minimum heap algorithm, along with the demo program
Platform: | Size: 2048 | Author: 沈 | Hits:

[OS program] heap

Description: STL中关于heap用法STL里面的堆操作一般用到的只有4个。他们就是make_heap() 、pop_heap() 、push_heap() 、sort_heap() 他们的头函数是algorithm -About STL heap Usage STL inside the reactor operation is generally used only four. Them is make_heap the () pop_heap () push_heap () sort_heap () their heads function is the algorithm
Platform: | Size: 1024 | Author: 王孟贤 | Hits:

[Algorithm] Heap-Sort-Algorithm-Pseudo-Code

Description: The heapsort algorithm can be divided into two parts. In the first step, a heap is built out of the data. In the second step, a sorted array is created by repeatedly removing the largest element from the heap, and inserting it into the array. The heap is reconstructed after each removal. Once all objects have been removed from the heap, we have a sorted array. The direction of the sorted elements can be varied by choosing a min-heap or max-heap in step one. Heapsort can be performed in place. The array can be split into two parts, the sorted array and the heap.The heap s invariant is preserved after each extraction, so the only cost is that of extraction.
Platform: | Size: 6144 | Author: subodh | Hits:

[Data structs] Heap

Description: 数据结构经典算法之-堆排序算法源码，附带详细注释-Data structure heap sort algorithm source code
Platform: | Size: 1063936 | Author: | Hits:

[Other] stack-heap

Description: 堆和栈的区别 一、预备知识—程序的内存分配 一个由C/C++编译的程序占用的内存分为以下几个部分 1、栈区（stack）— 由编译器自动分配释放 ，存放函数的参数值，局部变量的值等。其 操作方式类似于数据结构中的栈。 2、堆区（heap） — 一般由程序员分配释放， 若程序员不释放，程序结束时可能由OS回 收 。注意它与数据结构中的堆是两回事，分配方式倒是类似于链表，呵呵。 3、全局区（静态区）（static）—，全局变量和静态变量的存储是放在一块的，初始化的 全局变量和静态变量在一块区域， 未初始化的全局变量和未初始化的静态变量在相邻的另 一块区域。 - 程序结束后由系统释放。 4、文字常量区 —常量字符串就是放在这里的。 程序结束后由系统释放 5、程序代码区—存放函数体的二进制代码。 -Difference between heap and stack A knowledge, preparation- program memory allocation A C/C++ compiler program memory is divided into the following parts 1, the stack area (stack)- released by the compiler automatically assigned, storage function of parameter values, the value of the local variable, etc. its Mode of operation is similar to the stack in data structure. 2, heap area (heap)- generally assigned by the programmer to release, if the programmer does not release, at the end of the program may be back by the OS Closed. Pay attention to it and the heap data structure is different, distribution is similar to the linked list, ha ha. 3, global (static) (static)-, global and static variables stored is placed on a piece of, initialization Global and static variables in an area, an uninitialized global variables and static variables uninitialized in neighbouring the other An area.- application by the system after the release. 4, literal constant area- constant string is here
Platform: | Size: 8192 | Author: 星火 | Hits:

[JSP] Heap

Description: 把Heap.java档改写成顺序. 开头的是最小数目,结尾最大.-The Heap.java file rewrite order. In ascending order. The root node is smallest number.
Platform: | Size: 2048 | Author: vernon | Hits:

[source in ebook] kruskal-heap

Description: THUAT TOAT KARUKAL XULY BANG HEAP
Platform: | Size: 1024 | Author: tan | Hits:

[Data structs] heap-sort

Description: 利用系统生成随机数，然后将生成的随机数进行堆排序堆排序-heap sort
Platform: | Size: 1024 | Author: 杨星 | Hits:

[Linux-Unix] test-heap-profiler

Description: Constructor Heap Profile Test Helper Source Code for Linux.
Platform: | Size: 3072 | Author: puigoco | Hits:

[Linux-Unix] test-heap

Description: Check Heap Map Source Code for Linux.
Platform: | Size: 5120 | Author: waomuecun | Hits:

[Data structs] fibonacci-heap

Description: 斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。-Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.
Platform: | Size: 2048 | Author: azioli | Hits:
« 1 2 3 4 5 6 78 9 10 11 12 ... 50 »

CodeBus www.codebus.net