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

📄 text7-22.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">第七章</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">

<b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">
<font color="#FF0000" size="5">7.7 heap sort</font>

<font color="#FF0000">heap sort </font> ----   a fixed amount of additional storage
                            same time  O(<img src="image/nlogn.gif" width="79" height="24" align="middle">   ) 
<i><font color="#0033CC">⊙slightly slower than merge sort using O(n) additional space
faster than merge sort using O(1) additional space</font></i>

void adjust<font color="#FF0000">(element list[ ] , int root, int n)
<i><font size="3" color="#CC0099">/* adj</font></i></font><i><font size="3" color="#CC0099">ust the binary tree to establish the heap */</font></i></font></b></pre>
<table width="75%" border=" " cellspacing="0" height="46" cellpadding="0">
  <tr>
    <td width="50%"> 
      <pre><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">{ int child,rootkey;
        element temp;
        temp = list[root];
        rootkey = list[root].key;
        child = 2*root;  <i><font size="3" color="#CC0099">/* left child */</font></i>
        while (child <= n){</font></b></pre>
    </td>
    <td width="50%"><img src="IMAGE/text7-a0.gif" width="347" height="158"></td>
  </tr>
</table>
<pre align="left"><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">                if ((child < n) && (list[child].key < list[child+1].key))
                     child++;
                if (rootkey > list[child].key)    /<i><font size="3" color="#CC0099">* compare root and  max child */
 </font></i>                    break;
                else{
                     list[child/2] = list[child]; <i><font size="3" color="#CC0099">   /* move to parent */</font></i>
                     child *= 2;
               }     
        }      
        list [child/2] = temp;
}

</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="text7-index.htm"></map></a></td>
    <td width="131"><font face="楷体_GB2312" size="2"><b><a href="text7-21.htm">上一页</a> 
      <a href="text7-23.htm">下一页</a> </b></font></td>
  </tr>
</table>
</body>
</html>

⌨️ 快捷键说明

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