text1-22.htm

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

HTM
71
字号
<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">第一章</font><b>|</b><font face="宋体" size="2"><a href="text2-0.htm">第二章</a></font><b>|</b><font face="宋体" size="2"><a href="text3-0.htm">第三章</a></font><b>|</b><font face="宋体" size="2"><a href="text4-0.htm">第四章</a></font><b>|</b><font face="宋体" size="2"><a href="text5-0.htm">第五章</a></font><b>|</b><font face="宋体" size="2"><a href="text6-0.htm">第六章</a></font><b>|</b><font face="宋体" size="2"><a href="text7-0.htm">第七章</a></font><b>|</b><font face="宋体" size="2"><a href="text8-0.htm">第八章</a></font><b>|</b><font face="宋体" size="2"><a href="text9-0.htm">第九章</a></font><b>|</b><font face="宋体" size="2"><a href="text10-0.htm">第十章</a></font><b>|</b><font size="2" face="宋体"><a href="textA-0.htm">算法分析</a><b><font color="#000000">|</font></b> 
  </font></div>
<div id="Layer1" style="position:absolute; width:724px; 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">第一章</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"><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><font face="Arial, Helvetica, sans-serif" color="#000000" size="4"><b>
</b></font><font face="Arial, Helvetica, sans-serif" color="#000000" size="4"><b>【<font color="#0000FF">example</font>】<font color="#FF0033">Worst case performance for sequential search</font>

<font color="#FF0033"><i>sequential search function:
</i></font>
int <font color="#FF0033">seqsearch</font> (int list[ ], int searchnum, int n)
{ <font size="3"> <font color="#FF0099">/*<i>search an array, list, that has n number, return i , 
      if   list [ i ] = searchnum.   return -1, 
     if searchnum is not in the list</i> *</font></font><font color="#FF0099"> /</font>
     int i;
    list [ n ] = searchnum;
    for ( i = 0; list[ i ] != searchnum; i ++)
       ;
    return ((i < n) i : -1);
}

</b></font><font face="Arial, Helvetica, sans-serif" color="#000000" size="4"><b>#include<stdio.h> &lt;stdio.h&gt;
#include &lt;time.h&gt;<time.h>
#define<font size="3"> MAX_SIZE 1001</font>         <font color="#ff0099" size="3">   /*最大的搜索数组1000*/</font>
#define <font size="3">INTERA</font>
int <font color="#FF0066">segsearch</font>( int [ ], int, int);
void <font color="#FF0033">main</font> (void)
{
   int i, j, position;
   int  list[<font size="3">MAX_SIZE</font>];
   int  sizelist[ ] =  { <i><font size="3">0, 10,20, 30, 40, 50, 60, 70, 80, 90, 100, 200, 400,
                                   600, 800,  1000</font></i>};
   int numtimes [ ] = {<i><font size="3">30000, 12000, 6000, 5000, 4000,4000,4000, 3000,
                                       3000, 2000,  2000,1000, 500, 500, 500, 200</font></i>};
  clock_t  start, stop;
  double duration, total;
  for ( i =0; i < <font size="3">MAX_SIZE</font>;  i++ )  
          list [ i ] =  i  ;
  for ( i =0; i < interactions;  i++ ) 
        star = clock ( );
        for ( j =0; j < numtimes[i];  j++ )  {
                position = <font color="#FF0033">segsearch</font> ( list, -1, sizelist[ i ] );
        stop = clock ( );
      <font size="3" color="#FF0099">  /* <font size="2">CLK_TCK</font> = number of clock ticks per second */</font>
       total = ((double ) ( stop - start  )) / <font size="3">CLK_TCK</font>;
       printf ("%5d    %d   %d   %f    %f \ n", sizelist[ i ], numtimes [ i ],
                     int (stop -start), total, duration);
       list [ sizelist[ i ]] = sizelist[ i ];      <font size="3" color="#FF3399"> /*reset value在搜索时list[i]值已改变 */</font>
  }
}</b></font></pre>
<p align="left">&nbsp;</p>
<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="text1-index.htm"></map></a></td>
    <td width="131"><font face="楷体_GB2312" size="2"><b><a href="text1-21.htm">上一页</a> 
      <a href="text1-23.htm">下一页 </a> </b></font></td>
  </tr>
</table>
<p align="left">&nbsp;</p>
</body>
</html>

⌨️ 快捷键说明

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