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

📄 text8-12.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"><a href="../text7/text7-0.htm">第七章</a></font><b>|</b><font face="宋体" size="2">第八章</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>
2. <font color="#FF0000">chaining</font>
     <i><font color="#0033CC">bucket  ~   list </font></i>
#define MAX_CHAR    10       <i><font size="3" color="#CC0099">  /* max identifier size */</font></i>
#define TABLE_SIZE  13         <i><font size="3" color="#CC0099">/* prime  number  */</font></i>
#define  IS_FULL( ptr )   ( !(ptr))
typedef  struct {
		char  key [MAX_CHAR ]
		<i><font size="3" color="#CC0099">/* other fields */</font></i>
		} <font color="#FF0000">element</font>;
typedef  struct  list  *list_pointer;
typedef  struct <font color="#FF0000"> list </font> {
		element  item;
		list_pointer  link ;
		}
list_pointer  hash_table [TABLE_SIZE ];

<font color="#FF0000">Chain insert into a hash table</font>
void <font color="#FF0000">chain_insert</font>  ( element item,list_pointer ht[ ] )
{
<i><font size="3" color="#CC0099">/* insert the key into the table using chaining */</font></i>
        int hash_value = hash  ( item.key ) ; 
        list_pointer ptr, trail = NULL, lead = ht[hash_value] ; 
        for   (  ; lead ; trail = lead, lead = lead->link )
            if   ( !strcmp  ( lead->item.key, item.key ) ){
                fprintf  ( stderr,"The key is in the table\n" ) ; 
                exit  ( 1 ) ; 
            }
        ptr =   ( list_pointer )malloc  ( sizeof  ( list ) ) ; 
        if   ( IS_FULL  ( ptr ) ){
            fprintf  ( stderr,"The memory is full\n" ) ; 
            exit  ( 1 ) ; 
        }   
        ptr->item = item ; 
        ptr->link = NULL ; 
        if   ( trail )
            trail->link = ptr ; 
        else
            ht[hash_value] = ptr ; 
}

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


⌨️ 快捷键说明

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