text1-3.htm

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

HTM
84 行
字号 
<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:715px; 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>
<p>&nbsp;</p>
<pre><font face="Arial, Helvetica, sans-serif" size="4"><b>〖<font color="#333333">example1</font>〗<font color="#FF0066">selection sort</font>
 <font color="#0000FF">  algorithm:</font>
     for (i=0; i&lt;n; i++)
                     { examine list[i] to list[n-1] and suppose that the
                        smallest integer is at list[min];
	                    interchange list[i] and list[min];
                     }

<font color="#0066FF"> Program:</font>
    for interchanging:
            1.  <font color="#FF0066">macro version </font>    
                  #define swap (x, y, t )  (( t ) =  ( x ), ( x ) = ( y ), ( y ) = ( t ))
            2. <font color="#FF3366">function version</font>    swap ( int  *a, *b);
                 void swap ( int *x, int *y )      <i><font size="3" color="#CC0099"> /* both parameters are pointers 
                                                                      to ints */</font></i>
                 { int  temp = *x ;    <i><font size="3" color="#CC0099">/* declares temp as an int and assigns 
                                                  to it the contents of what x  points to */</font></i>
                    *x = *y;       <i><font size="3" color="#CC0099"> /* stores what y points to into the location 
                                            where x   points*/</font></i>
                    *y = temp; <i><font size="3" color="#CC0099">  /*places the contents of temp in location 
                                           pointed to  by y*/</font></i>
                 }

#include&lt;stdio.h&gt;
#include&lt;math.h&gt;
#define MAX_SIZE 101
#define SWAP(x, y, t) ((t) = (x),(x) = (y), (y) = (t))
void<font color="#FF3366"> sort </font>( int [ ], int );             /*selection sort*/
void main (void)
{
 int i,n;
 int list [MAX_SIZE];
 printf ("Enter the number of numbers to generate; ");
 scan ("%d", &n);
 if ( n < 1 || n > MAX_SIZE) {
     printf (stderr, "Improper value of n\n");
     exit (1);
  }
 for (i = 0; i < n; i++)   {     <i><font size="3" color="#CC0099">   /* randomly generate numbers*/</font></i>
       list [ i ] = rand ( ) % 1000;
       printf ("%d  ",list [ i ]);
  }
  <font color="#FF0066">sort ( list , n )</font> ;
  printf ( " \n Sorted array: \n ");
  for ( i = 0 ; i < n ; i++ )     <i><font size="3" color="#CC0099"> /*print out sorted numbers */ </font></i>
        printf ( "%d  ", list [ i ] );
  printf ( " \n " );
}

<font color="#FF0033">void sort ( int list [ ] ,int n )</font>
{
  int i,  j, min, temp;
  for ( i = 0; i < n-1; i++ )   {
       min = i;
       for ( j = i + 1;  j < n;  j++ )
            if ( list [ j ] &lt; list [ min ] )
       SWAP ( list [ i  ], temp );
   </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="text1-index.htm"></map></a></td>
    <td width="131"><font face="楷体_GB2312" size="2"><b><a href="text1-2.htm">上一页</a> 
      <a href="text1-4.htm">下一页</a></b></font></td>
  </tr>
</table>
<p align="left">&nbsp; </p>
</body>
</html>

text1-3.htm - 源码说明

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

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

⌨️ 快捷键说明

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