📄 text7-14.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="5" color="#FF0000">7.6 Merge sort</font><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">
(1) <font color="#FF0000">merging </font>
<font color="#0033CC">algorithm1</font>
void <font color="#FF0000">merge</font>(element list[ ],element sorted[ ],int i,int m, int n)
<i><font size="3" color="#CC0099">/* merge two sorted files: list[i], ..., list[m], and list[m+1], ..., list[n]. These
files are sorted to obtain a sorted list : sorted [i] , ..., sorted[n] */</font></i></font></b></pre>
<table width="755" cellspacing="0">
<tr>
<td width="431">
<pre><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">{
int j, k, t;
j = m+1;<i><font size="3" color="#CC0099"> /* index for the second sublist */</font></i>
k = i; <i><font size="3" color="#CC0099">/* index for the sorted list */</font></i>
while ( i <= m && j <= n){
if ( list[i].key <= list[j].key)
sorted[k++] = list[i++];
else
sorted[k++] = list[j++];
}
if (i > m)
<i><font size="3" color="#CC0099">/* sorted[k],...,sorted[n] = list[j],...list[n] */</font></i>
for (t = j; t <= n; t++)
sorted[k+t-j] = list[t];
else
<i><font size="3" color="#CC0099">/* sorted[k], ...,sorted[n] = list[i], ..., list[m] */</font></i>
for (t = i; t <= m; t++)
sorted[k+t-i] = list[t];
}</font></b></pre>
</td>
<td width="342">
<pre><img src="image/merge1.gif" width="326" height="126"></pre>
</td>
</tr>
</table>
<pre align="left"><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><font color="#FF0000">complexity</font>
computing time: <font color="#FF0000"> O( n - i + 1)</font>
m - the length of a record <font color="#FF0000">O( m( n - i + 1))
</font></font></b></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="text7-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text7-13.htm">上一页</a>
<a href="text7-15.htm">下一页</a></b></font></td>
</tr>
</table>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -