文件名称:Heaps
介绍说明－－下载内容均来自于网络，请自行研究使用
Many applications require that we process records with keys in order, but not necessarily in full sorted order.
Often we collect a set of items and process the one with the current minimum value.
e.g. jobs sent to a printer,
Operating system job scheduler in a multi-user environment.
Simulation environments
An appropriate data structure is called a priority queue.
Often we collect a set of items and process the one with the current minimum value.
e.g. jobs sent to a printer,
Operating system job scheduler in a multi-user environment.
Simulation environments
An appropriate data structure is called a priority queue.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Heaps.ppt