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

📄 text7-3.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"><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><b>
(3) <font color="#FF0000"> List verification</font>

<font color="#0033CC">compare lists</font> to verify that they are identical, or to identify the 
discrepancies.  ( an instance of repeatedly searching one list , 
using each key in the other list as the search key )

<font color="#FF0000">three types of error</font>
   1. a record with key list1 [i ].key appears in the first list, but there 
       is no record with the same key in the second list (list2).
   2. a record with key list2 [i ].key appears in the second list, but
       there is no record with the same key in the first list (list1).
   3. list1[ i ].key = list2 [ i ].key, but the two records do not match on 
       at least one of the other fields.

<font color="#FF0000">program1  </font>    <font color="#FF0000">O( mn )</font>

void<font color="#FF0000"> verify1</font>(element list1[ ], element list2[ ], int n, int m)
<i><font size="3" color="#CC0099">/* compare two unordered lists list1 and list2 */</font></i>
{        int i, j;
        int marked[MAX_SIZE];       
        for (i = 0; i < m; i++)
           marked[i] = FALSE;
        for (i = 0; i < n; i++)
           if ((j = seqsearch(list2, m, list1[ i ].key)) < 0)
               printf("%d is not in list2 \n", list1[ i ].key);
           else 
          <i><font size="3" color="#CC0099"> /* check each of the other fields from list1[i] and
           list2[j],and print out any discrepancies */</font></i>
               marked[j] = TRUE;
        for (i = 0; i < m; i++)
           if ( !marked[ i ])
               printf("%d is not in list1\n", list2[ i ].key);</b></font>
<b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">}

</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-2.htm">上一页</a> 
      <a href="text7-4.htm">下一页</a> </b></font></td>
  </tr>
</table>
</body>
</html>

⌨️ 快捷键说明

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