⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 text9-10.htm

📁 浙江大学计算机学院数据结构课程的教学课件
💻 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">(2) <font color="#FF0000">deletion of min element</font>
               
            j = i +  <img src="image/logi.gif" width="64" height="30" align="middle">               if ( j > n )  j /= 2

                              <img src="image/text9-k.gif" width="305" height="123">           

element <font color="#FF0000">deap_delete_min</font>(element deap[ ] , int *n)
{
<i><font size="3" color="#CC0099">/* delete the minimum element from the heap: </font></i><font color="#CC0099"><i><font color="#FF0000"> O ( log n ) </font></i></font><i><font size="3" color="#CC0099">*/</font></i>
  int i ,  j;
  element temp;
  if (*n  <  2) {
    fprintf(stderr , "The deap is empty\n");
   <i><font size="3" color="#CC0099"> /* return an error code to user */</font></i>
    deap[0].key  =   INT_MAX;
    return deap[0];
  }
  deap[0]  =   deap[2];      <i><font size="3" color="#CC0099"> /* save min element */</font></i>
  temp  =   deap[(*n)--];
  for (i =  2; i*2  <  =   *n; deap[i] =  deap[j] ,  i =  j) {
 <i><font size="3" color="#CC0099"> /* find node with smaller key */</font></i>
    j  =   i*2;
    if (j+1  <  =   *n) {
      if (deap[j].key > deap[j+1].key)
        j++;
    }
  }
  modified_deap_insert(deap , i , temp);<i><font size="3" color="#CC0099">/*temp insert to deap */</font></i>
  return deap[0];
}

<font color="#FF0000">exercises page 437/4

</font></font></b></pre>
<table width="731" cellspacing="0" cellpadding="0">
  <tr> 
    <td width="327">&nbsp;</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-9.htm">上一页</a> 
      <a href="text9-11.htm">下一页</a></b></font></td>
  </tr>
</table>
</body>
</html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -