📄 text9-5.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"><a href="../text5/text5-0.htm">第五章</a></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">第九章</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">
<b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">element <font color="#FF0000">delete_min</font>(element heap[ ], int *n)
{ <i><font size="3" color="#CC0099">/* delete the minimum element from the min-max heap: </font></i><font color="#CC0099"><i><font color="#FF0000"> O(log n) */ </font></i></font><i></i></font></b></pre>
<table width="76%" border=" " cellspacing="0">
<tr>
<td width="48%">
<pre><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><i><font size="3" color="#CC0099"> </font></i>
int i, last, k, parent;
element temp, x;
if ( !(*n) ) {
fprintf(stderr,"The heap is empty\n");
heap[0].key = INT_MAX; <i><font size="3" color="#CC0099">/* error key in heap[0] */</font></i>
return heap[0];
}
heap[0] = heap[1]; <i><font size="3" color="#CC0099">/* save the element */</font></i>
x = heap[ (*n)-- ];
<i><font size="3" color="#CC0099"> /* find place to insert x */</font></i>
for ( i = 1, last = (*n)/2; i <= last;) {
k = min_child_grandchild(i, *n);
if (x.key <= heap[k].key) break;
<font color="#CC0099"> /* case 2(b) or 2(c) */</font>
heap[i] = heap[k];
if (k <= 2*i+1) { <font color="#CC0099">/* 2(b) */</font>
i = k;
break;
}
<font color="#FF0000"> <font color="#CC0099">/* case 2(c), k is a grandchild of i */</font></font>
parent = k/2;
if (x.key > heap[parent].key)
SWAP(heap[parent],x,temp);
i = k;
} <i><font size="3" color="#CC0099">/* for */</font></i>
heap[i] = x;
return heap[0];
}</font></b></pre>
</td>
<td width="52%"><img src="IMAGE/abc.gif" width="219" height="403"></td>
</tr>
</table>
<p> </p>
<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="text9-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text9-4.htm">上一页</a>
<a href="text9-6.htm">下一页</a> </b></font></td>
</tr>
</table>
<p> </p>
<pre align="left"><b></b></pre>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -