📄 text3-25.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">第三章</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"><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><font face="Arial, Helvetica, sans-serif" size="5" color="#FF0033"><b>！Configuration when stack i meet stack i =1,
but the memory is not full
</b></font><img src="image/mulstack1.gif" width="569" height="97" hspace="100"><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><i><font color="#0033CC"> b=boundary ,t=top</font></i></font></b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">
<font color="#FF0033">We can design stack_full so that we can add elements to this
stack untill the array is full in the following way:</font>
(i) create a space between stack <i>stack_no</i> and <i>stack_no+1.</i>
determine the least j (<i> stack_no < j < n</i> )such that there is free
space between stack j and j + 1 (<i> top [j ] < boundary[ j + 1 ] </i>).
If there is such a j , then move <i>stack_no +1</i>, <i>stack_no +2</i>,…, <i>j</i>
one position to right.
(ii)create a space between stack<i> stack_no </i>and <i>stack_no+1</i>.
look to the left of <i>stack_no</i>, Find the largest j such that
<i>0 <= j < stack_no </i>and there is space between j and j +1
(<i>top [j] < boundary [j + 1]</i>). If there is such a j , move stacks
<i> j, j+1,,……, stack_no o</i>ne space to left.
(iii) If there is no j satisfying either condition (i) or (ii). then all
<font size="3">MEMORY_SIZE</font> spaces of memory are utilized and there is
no free space. In this case stack_full determinate with an
error message.
<font color="#FF0000">Exercises <font color="#000000">page 133/ 2
</font></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="text3-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text3-24.htm">上一页</a>
</b></font></td>
</tr>
</table>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -