📄 text5-31.htm
字号:
<html>
<head>
<title>Untitled Document</title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body bgcolor="#FFFFFF" link="#0000FF" vlink="#3399FF" alink="#FF0066">
<div id="Layer1" style="position:absolute; width:711px; height:21px; z-index:1; top: 10px; background-color: #CCCCCC; layer-background-color: #CCCCCC; border: 1px none #000000; left: 26px"><b>|</b><font face="宋体" size="2"><a href="../text1/text1-0.htm">第一章</a></font><b>|</b><font face="宋体" size="2"><a href="../text2/text2-0.htm">第二章</a></font><b>|</b><font face="宋体" size="2"><a href="../text3/text3-0.htm">第三章</a></font><b>|</b><font face="宋体" size="2"><a href="../text4/text4-0.htm">第四章</a></font><b>|</b><font face="宋体" size="2">第五章</font><b>|</b><font face="宋体" size="2"><a href="../text6/text6-0.htm">第六章</a></font><b>|</b><font face="宋体" size="2"><a href="../text7/text7-0.htm">第七章</a></font><b>|</b><font face="宋体" size="2"><a href="../text8/text8-0.htm">第八章</a></font><b>|</b><font face="宋体" size="2"><a href="../text9/text9-0.htm">第九章</a></font><b>|</b><font face="宋体" size="2"><a href="../text10/text10-0.htm">第十章</a></font><b>|</b><font size="2" face="宋体"><a href="../textA/textA-0.htm">算法分析</a><b><font color="#000000">|</font></b>
</font></div>
<pre align="left"><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><b>
(3) <font color="#FF0000">deletion from a max heap O(</font><font face="Arial, Helvetica, sans-serif" size="4" color="#FF0000"><b>nlog<font size="2">n</font></b></font><font color="#FF0000"> )</font>
<img src="IMAGE/text5-v.gif" width="498" height="173">
element <font color="#FF0000">delete_max_heap</font>(int *n)
{ <i><font size="3" color="#CC0099"> /* delete element with the highest key from the heap */</font></i>
int parent,child;
element item, temp;
if (HEAP_EMPTY(*n)) {
fprintf (stderr, "The heap is empty\n");
exit (1);
}
<i><font size="3" color="#CC0099"> /* save value of the element with the highest key */</font></i>
item = heap[1];
<i><font size="3" color="#CC0099"> /* use last element in heap to adjust heap */
</font></i> temp = heap[ (*n)--] ;
parent = 1;
child = 2;
while (child <=*n) {
<i><font size="3" color="#CC0099"> /* find the larger child of the current parent */</font></i>
if (child < *n) && (heap[child].key< heap[child+1].key)
child++;
if (temp.key >= heap[child].key) break;
/* move to the next lower level */
heap[parent] = heap[child];
parent = child;
child* = 2;
}
heap [parent] = temp;
return item;
}
</b></font></pre>
<table width="731" cellspacing="0" cellpadding="0">
<tr>
<td width="327"> </td>
<td width="271"><a href="../index.htm"><img width="60" height="25" usemap="#MapMap4" border="0" src="../../images/home.gif"></a><a href="../index.htm"><map name="MapMap4"><area shape="rect" coords="42,-34,88,-15" href="text0.htm"><area shape="rect" coords="4,4,55,23" href="text5-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text5-30.htm">上一页</a>
<a href="text5-32.htm">下一页</a> </b></font></td>
</tr>
</table>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -