搜索结果
找到约 38 项符合
HEAP 的查询结果
按分类筛选
通讯编程文档 堆积（heap）是树结构的第三种型态。堆积是一棵二元树
堆积（heap）是树结构的第三种型态。堆积是一棵二元树，其左右子树节点的值均较其父母节点的值小。堆积的根节点值保证是该树最大值。这中堆绩称为最大堆绩。堆积的子树可摆在左边当左子树，也可摆在右边当右子树，因此左右子树俱有相同的性质。 ...
数值算法/人工智能 这是一段关于四种排序方法的完全源代码及其相互之间的比较,包括:Heap sort,Merge sort,Quick sort,Radix sort
这是一段关于四种排序方法的完全源代码及其相互之间的比较,包括:Heap sort,Merge sort,Quick sort,Radix sort
Symbian symbian c++ example buffering and string heap buffer
symbian c++ example buffering and string heap buffer
数据结构 heap sort is a sorting algorithm used for sorting data
heap sort is a sorting algorithm used for sorting data
Internet/网络编程 The Gray Watson debugging malloc library is C source code for a drop in replacement for the system m
The Gray Watson debugging malloc library is C source code for a drop in replacement for the system malloc & other memory manage ment routines. What is unique about this library is that it contains a number of powerful debugging facilities including very comprehensive heap testing and ex- cellent run ...
Delphi/CppBuilder Overview In this chapter I introduce Borland C++Builder (BCB) and explain what it is about. I also d
Overview In this chapter I introduce Borland C++Builder (BCB) and explain what it is about. I also devote considerable time to explaining the purpose of this book and the philosophy behind my approach to technical writing. Technical subjects covered in this chapter include Creating a simple Multimed ...
Linux/Unix编程 The Valgrind distribution has multiple tools. The most popular is the memory checking tool (called M
The Valgrind distribution has multiple tools. The most popular is the memory checking tool (called Memcheck) which can detect many common memory errors such as:
*
touching memory you shouldn t (eg. overrunning heap block boundaries)
*
using values before they have been initialized
*
inco ...
技术管理 堆和栈的区别 一、预备知识—程序的内存分配 一个由c/C++编译的程序占用的内存分为以下几个部分 1、栈区（stack）— 由编译器自动分配释放
堆和栈的区别
一、预备知识—程序的内存分配
一个由c/C++编译的程序占用的内存分为以下几个部分
1、栈区（stack）— 由编译器自动分配释放 ，存放函数的参数值，局部变量的值等。其操作方式类似于数据结构中的栈。
2、堆区（heap） — 一般由程序员分配释放， 若程序员不释放，程序结束时可能由OS回收 。注意它与数据结构中 ...
人工智能/神经网络 This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your pr
This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your program. It s a port from Patrick Lesters example in BlitzBasic to VB.Net. It uses a Binary Heap class I made to sort the score values.
数据结构 Dijkstra算法
Dijkstra算法，Heap优化，复杂度NlogN