text2-0.htm

来自「浙江大学计算机学院数据结构课程的教学课件」· HTM 代码 · 共 65 行

HTM
65 行
字号 
<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">第二章</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"><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">
2.1<font color="#ff0033"> The array as an Abstract Data Type</font><br>
<font color="#0000FF">DEFINITION</font></font></b><br><b><font face="Arial, Helvetica, sans-serif" size="4">_______________________________________________
structure  <font color="#ff0033">Array </font>is
    <font color="#0000FF"><i>object</i></font>:  A set pairs <i><font color="#FF0033">&lt;index, value&gt;</font></i> where for each <i><font color="#FF0033">value </font></i>of index 
                   there is a value from the set item.<font color="#FF0033"><i> Index</i></font> is a finite orde-
                   red set of one or more  dimensions, for  example, 
                   [<i><font size="3">0, … , n-1 ]</font></i> for one dimension , 
                   [<i><font size="3">(0,0),(0,1),(0,2), (1,0),(1,1),(1,2),(2,0),(2,1),(2,2)</font></i>] 
                   for tow dimensions,etc.
	<font color="#0000FF"><i>functions:</i></font>
	              for all <i>A<img src="image/Image4.gif" width="20" height="19"> Array, i <img src="image/Image4.gif" width="20" height="19"> index, x <img src="image/Image4.gif" width="20" height="19">   item, j, size <img src="image/Image4.gif" width="20" height="19">  integer
	</i>
<font color="#ff0099">Array Create( j, list) </font>   ::= <font size="3">  return an array of j dimensions where 
                                                   list is  a<i> j-tuple</i> whose i th element is 
                                                   the size of the <i> i </i>th  dimension.  Items 
                                                   are undefined.</font>
	
<font color="#ff0099">Item Retrieve(A,i)</font><font color="#ff0000">   </font>      ::=  <font size="3">If (i </font><img src="image/Image4.gif" width="20" height="19"><font size="3">  index) return item associated with 
                                                   index  value i in array A.
                                                   else return error</font>
	
<font color="#ff0099">Array store (A, i, x )</font>     ::=  <font size="3"> if ( i in index)
                                                   return an array that is identical to array A 
                                                   except the  new pair  <i>&lt;i, x&gt;</i> has been inserted
                                                   else return error</font>
end <font color="#ff0033">Array</font>
___________________________________________________________________</font></b></pre>
<pre align="left"><b><font face="Arial, Helvetica, sans-serif" size="4">
 <font color="#0000FF">REPRESENTATION
<font color="#000000">C : int  list [ 5 ], *plist [ 5 ]

     <i> list[0],…,list[4]    </i>  --- the name of the five array elements each of 
                                            which contains an integer.
    <i>  plist[0],…,plist[4]-</i> -- the name of the five array elements each of 
                                           which  contains a pointer to an integer

	<i>list   </i>     -----  a pointer to list [ 0 ]
	<i>list +  i</i>  ------ a pointer to list [ i ]

	       <font color="#FF0033"><i> (list + i ) = & list[ i ]               	* (list + i ) =  list[ i ]
</i></font></font>
</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="text2-index.htm"></map></a></td>
    <td width="131"><font face="楷体_GB2312" size="2"><b><a href="../text0.htm">上一页</a> 
      <a href="text2-1.htm">下一页</a> </b></font></td>
  </tr>
</table>
</body>
</html>

text2-0.htm - 源码说明

本页面展示了「浙江大学计算机学院数据结构课程的教学课件」中的 text2-0.htm 源码文件，采用 HTM 编程语言编写，共 65 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与大学相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

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