Java程序员的8大排序，你知道几个？

痛定思痛。 2022-03-12 19:09 258阅读 0赞

进QQ群：259038500即可免费领取Java学习视频8种排序之间的关系:

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70][]

**1， 直接插入排序**

（1）基本思想：在要排序的一组数中，假设前面(n-1)\[n>=2\] 个数已经是排

好顺序的，现在要把第n个数插到前面的有序数中，使得这n个数

也是排好顺序的。如此反复循环，直到全部排好顺序。

（2）实例

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 1][]

（3）用java实现

<table style="margin-left:3.15pt;width:127.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">01</p> </td> 
   <td colspan="2" style="width:111.75pt;"> <p style="margin-left:0pt;">package&nbsp;com.njue;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">02</p> </td> 
   <td style="width:109.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:181.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">03</p> </td> 
   <td colspan="2" style="width:165.75pt;"> <p style="margin-left:0pt;">public&nbsp;class&nbsp;insertSort { </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">04</p> </td> 
   <td style="width:163.5pt;"> <p style="margin-left:0pt;">public&nbsp;insertSort(){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:241.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">07</p> </td> 
   <td colspan="2" style="width:225.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=1;i&lt;a.length;i++){ </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">08</p> </td> 
   <td style="width:223.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;j=i-1;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:14.6pt;"> <p style="margin-left:0pt;">11</p> </td> 
   <td colspan="3" style="width:405.2pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;a[j+1]=a[j];&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//将大于temp的值整体后移一个单位</p> </td> 
  </tr> 
  <tr> 
   <td colspan="2" style="width:16.25pt;"> <p style="margin-left:0pt;">12</p> </td> 
   <td style="width:401.3pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:251.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">15</p> </td> 
   <td style="width:235.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length;i++)</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">16</p> </td> 
   <td colspan="2" style="width:237.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(a[i]);</p> </td> 
  </tr> 
 </tbody> 
</table>

**2， 希尔排序（最小增量排序）**

（1）基本思想：算法先将要排序的一组数按某个增量d（n/2,n为要排序数的个数）分成若干组，每组中记录的下标相差d.对每组中全部元素进行直接插入排序，然后再用一个较小的增量（d/2）对它进行分组，在每组中再进行直接插入排序。当增量减到1时，进行直接插入排序后，排序完成。

（2）实例：

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 2][]

**（3）用java实现**

<table style="margin-left:3.15pt;width:175.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">01</p> </td> 
   <td colspan="2" style="width:159.75pt;"> <p style="margin-left:0pt;">public&nbsp;class&nbsp;shellSort { </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">02</p> </td> 
   <td style="width:157.5pt;"> <p style="margin-left:0pt;">public&nbsp;&nbsp;shellSort(){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:301.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">03</p> </td> 
   <td colspan="2" style="width:285.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;a[]={1,54,6,3,78,34,12,45,56,100};</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">04</p> </td> 
   <td style="width:283.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;double&nbsp;d1=a.length;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:139.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">05</p> </td> 
   <td style="width:123.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;temp=0;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">06</p> </td> 
   <td style="width:123.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;while(true){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:353.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">09</p> </td> 
   <td style="width:337.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;x=0;x&lt;d;x++){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">10</p> </td> 
   <td colspan="2" style="width:339.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=x+d;i&lt;a.length;i+=d){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:197.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">19</p> </td> 
   <td style="width:181.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(d==1)</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">20</p> </td> 
   <td colspan="2" style="width:183.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;break;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:233.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">21</p> </td> 
   <td style="width:217.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">22</p> </td> 
   <td colspan="2" style="width:219.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length;i++)</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:265.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">23</p> </td> 
   <td colspan="2" style="width:249.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(a[i]);</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">24</p> </td> 
   <td style="width:247.5pt;"> <p style="margin-left:0pt;">}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

**3.简单选择排序**

（1）基本思想：在要排序的一组数中，选出最小的一个数与第一个位置的数交换；

然后在剩下的数当中再找最小的与第二个位置的数交换，如此循环到倒数第二个数和最后一个数比较为止。

（2）实例：

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 3][]

（3）用java实现

<table style="margin-left:3.15pt;width:191.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">01</p> </td> 
   <td style="width:175.5pt;"> <p style="margin-left:0pt;">public&nbsp;class&nbsp;selectSort { </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">02</p> </td> 
   <td colspan="2" style="width:177.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;public&nbsp;selectSort(){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:307.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">03</p> </td> 
   <td colspan="2" style="width:291.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;a[]={1,54,6,3,78,34,12,45};</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">04</p> </td> 
   <td style="width:289.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;position=0;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:289.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">05</p> </td> 
   <td colspan="2" style="width:273.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length;i++){ </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">06</p> </td> 
   <td style="width:271.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:229.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">07</p> </td> 
   <td style="width:213.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;j=i+1;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">08</p> </td> 
   <td style="width:213.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;position=i;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:287.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">09</p> </td> 
   <td style="width:271.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;temp=a[i];</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">10</p> </td> 
   <td colspan="2" style="width:273.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(;j&lt;a.length;j++){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:277.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">13</p> </td> 
   <td colspan="2" style="width:261.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;position=j;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">14</p> </td> 
   <td style="width:259.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:263.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">15</p> </td> 
   <td style="width:247.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">16</p> </td> 
   <td colspan="2" style="width:249.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;a[position]=a[i];</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:311.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">19</p> </td> 
   <td style="width:295.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length;i++)</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">20</p> </td> 
   <td colspan="2" style="width:297.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(a[i]);</p> </td> 
  </tr> 
 </tbody> 
</table>

**4， 堆排序**

（1）基本思想：堆排序是一种树形选择排序，是对直接选择排序的有效改进。

堆的定义如下：具有n个元素的序列（h1,h2,...,hn),当且仅当满足（hi>=h2i,hi>=2i+1）或（hi<=h2i,hi<=2i+1）(i=1,2,...,n/2)时称之为堆。在这里只讨论满足前者条件的堆。由堆的定义可以看出，堆顶元素（即第一个元素）必为最大项（大顶堆）。完全二叉树可以很直观地表示堆的结构。堆顶为根，其它为左子树、右子树。初始时把要排序的数的序列看作是一棵顺序存储的二叉树，调整它们的存储序，使之成为一个堆，这时堆的根节点的数最大。然后将根节点与堆的最后一个节点交换。然后对前面(n-1)个数重新调整使之成为堆。依此类推，直到只有两个节点的堆，并对它们作交换，最后得到有n个节点的有序序列。从算法描述来看，堆排序需要两个过程，一是建立堆，二是堆顶与堆的最后一个元素交换位置。所以堆排序有两个函数组成。一是建堆的渗透函数，二是反复调用渗透函数实现排序的函数。

（2）实例：

初始序列：46,79,56,38,40,84

建堆：、

\-进QQ群：259038500即可免费领取Java学习视频

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 4][]

交换，从堆中踢出最大数

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 5][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 6][]

依次类推：最后堆中剩余的最后两个结点交换，踢出一个，排序完成。

（3）用java实现

<table style="margin-left:3.15pt;width:169.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">01</p> </td> 
   <td colspan="2" style="width:153.75pt;"> <p style="margin-left:0pt;">import&nbsp;java.util.Arrays;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">02</p> </td> 
   <td style="width:151.5pt;"> <p style="margin-left:0pt;">&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td colspan="2" style="width:14.6pt;"> <p style="margin-left:0pt;">03</p> </td> 
   <td style="width:402.95pt;"> <p style="margin-left:0pt;">public&nbsp;class&nbsp;HeapSort { </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:11.6pt;"> <p style="margin-left:0pt;">04</p> </td> 
   <td colspan="3" style="width:408.2pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:193.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">05</p> </td> 
   <td colspan="2" style="width:177.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;public&nbsp;&nbsp;HeapSort(){ </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">06</p> </td> 
   <td style="width:175.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;heapSort(a);</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:269.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">07</p> </td> 
   <td style="width:253.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">08</p> </td> 
   <td colspan="2" style="width:255.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;public&nbsp;&nbsp;void&nbsp;heapSort(int[] a){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:301.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">09</p> </td> 
   <td colspan="2" style="width:285.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println("开始排序");</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">10</p> </td> 
   <td style="width:283.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;arrayLength=a.length;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:317.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">11</p> </td> 
   <td style="width:301.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//循环建堆</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">12</p> </td> 
   <td colspan="2" style="width:303.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;arrayLength-1;i++){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:305.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">15</p> </td> 
   <td style="width:289.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;buildMaxHeap(a,arrayLength-1-i);</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">16</p> </td> 
   <td colspan="2" style="width:291.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//交换堆顶和最后一个元素</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:395.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">17</p> </td> 
   <td style="width:379.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;swap(a,0,arrayLength-1-i);</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">18</p> </td> 
   <td colspan="2" style="width:381.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(Arrays.toString(a));</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:383.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">21</p> </td> 
   <td style="width:367.5pt;"> <p style="margin-left:0pt;">&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">22</p> </td> 
   <td colspan="2" style="width:369.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;private&nbsp;&nbsp;void&nbsp;swap(int[] data,&nbsp;int&nbsp;i,&nbsp;int&nbsp;j) { </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:319.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">23</p> </td> 
   <td colspan="2" style="width:303.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;// TODO Auto-generated method stub</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">24</p> </td> 
   <td style="width:301.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;tmp=data[i];</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:287.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">27</p> </td> 
   <td style="width:271.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">28</p> </td> 
   <td colspan="2" style="width:273.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;//对data数组从0到lastIndex建大顶堆</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:415.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">29</p> </td> 
   <td colspan="2" style="width:399.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;private&nbsp;void&nbsp;buildMaxHeap(int[] data,&nbsp;int&nbsp;lastIndex) { </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">30</p> </td> 
   <td style="width:397.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;// TODO Auto-generated method stub</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:403.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">31</p> </td> 
   <td colspan="2" style="width:387.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//从lastIndex处节点（最后一个节点）的父节点开始</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">32</p> </td> 
   <td style="width:385.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=(lastIndex-1)/2;i&gt;=0;i--){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:292.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">33</p> </td> 
   <td colspan="2" style="width:276.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//k保存正在判断的节点</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">34</p> </td> 
   <td style="width:274.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;k=i;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:331.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">35</p> </td> 
   <td colspan="2" style="width:315.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//如果当前k节点的子节点存在</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">36</p> </td> 
   <td style="width:313.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;while(k*2+1&lt;=lastIndex){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:352.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">37</p> </td> 
   <td colspan="2" style="width:336.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//k节点的左子节点的索引</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">38</p> </td> 
   <td style="width:334.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;biggerIndex=2*k+1;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">39</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//如果biggerIndex小于lastIndex，即biggerIndex+1代表的k节点的右子节点存在</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">40</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(biggerIndex&lt;lastIndex){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td colspan="2" style="width:15.3pt;"> <p style="margin-left:0pt;">41</p> </td> 
   <td style="width:402.25pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//若果右子节点的值较大</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:13.5pt;"> <p style="margin-left:0pt;">42</p> </td> 
   <td colspan="3" style="width:406.3pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(data[biggerIndex]&lt;data[biggerIndex+1]){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">43</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//biggerIndex总是记录较大子节点的索引</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">44</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;biggerIndex++;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">47</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//如果k节点的值小于其较大的子节点的值</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">48</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(data[k]&lt;data[biggerIndex]){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:407.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">49</p> </td> 
   <td style="width:391.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//交换他们</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">50</p> </td> 
   <td colspan="2" style="width:393.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;swap(data,k,biggerIndex);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">51</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//将biggerIndex赋予k，开始while循环的下一次循环，重新保证k节点的值大于其左右子节点的值</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">52</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;k=biggerIndex;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:293.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">53</p> </td> 
   <td style="width:277.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}else{ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">54</p> </td> 
   <td colspan="2" style="width:279.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;break;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:413.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">55</p> </td> 
   <td style="width:397.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">56</p> </td> 
   <td colspan="2" style="width:399.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&lt;p align="left"&gt;&nbsp;&lt;span&gt;&nbsp;&nbsp; &lt;/span&gt;}&lt;/p&gt;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">57</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&lt;p align="left"&gt;&nbsp;&nbsp;&nbsp; }&lt;/p&gt;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">58</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&lt;p align="left"&gt;&nbsp;&lt;span style="background-color:white;"&gt;}&lt;/span&gt;&lt;/p&gt;</p> </td> 
  </tr> 
 </tbody> 
</table>

**5.冒泡排序**

（1）基本思想：在要排序的一组数中，对当前还未排好序的范围内的全部数，自上而下对相邻的两个数依次进行比较和调整，让较大的数往下沉，较小的往上冒。即：每当两相邻的数比较后发现它们的排序与排序要求相反时，就将它们互换。

（2）实例：

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 7][]

（3）用java实现

<table style="margin-left:3.15pt;width:181.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">01</p> </td> 
   <td colspan="2" style="width:165.75pt;"> <p style="margin-left:0pt;">public&nbsp;class&nbsp;bubbleSort { </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">02</p> </td> 
   <td style="width:163.5pt;"> <p style="margin-left:0pt;">public&nbsp;&nbsp;bubbleSort(){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:311.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">05</p> </td> 
   <td style="width:295.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length-1;i++){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">06</p> </td> 
   <td colspan="2" style="width:297.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;j=0;j&lt;a.length-1-i;j++){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:233.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">13</p> </td> 
   <td style="width:217.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">14</p> </td> 
   <td colspan="2" style="width:219.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length;i++)</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:241.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">15</p> </td> 
   <td colspan="2" style="width:225.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(a[i]);&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">16</p> </td> 
   <td style="width:223.5pt;"> <p style="margin-left:0pt;">}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

**6.快速排序**

（1）基本思想：选择一个基准元素,通常选择第一个元素或者最后一个元素,通过一趟扫描，将待排序列分成两部分,一部分比基准元素小,一部分大于等于基准元素,此时基准元素在其排好序后的正确位置,然后再用同样的方法递归地排序划分的两部分。

（2）实例：

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 8][]

（3）用java实现

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td colspan="2" style="width:14pt;"> <p style="margin-left:0pt;">01</p> </td> 
   <td style="width:403.55pt;"> <p style="margin-left:0pt;">public&nbsp;class&nbsp;quickSort { </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:12.05pt;"> <p style="margin-left:0pt;">02</p> </td> 
   <td colspan="3" style="width:407.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;int&nbsp;a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:151.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">03</p> </td> 
   <td colspan="2" style="width:135.75pt;"> <p style="margin-left:0pt;">public&nbsp;&nbsp;quickSort(){ </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">04</p> </td> 
   <td style="width:133.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;quick(a);</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:263.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">05</p> </td> 
   <td style="width:247.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length;i++)</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">06</p> </td> 
   <td colspan="2" style="width:249.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(a[i]);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:395.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">07</p> </td> 
   <td style="width:379.5pt;"> <p style="margin-left:0pt;">}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">08</p> </td> 
   <td colspan="2" style="width:381.75pt;"> <p style="margin-left:0pt;">public&nbsp;int&nbsp;getMiddle(int[] list,&nbsp;int&nbsp;low,&nbsp;int&nbsp;high) {&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">09</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;tmp = list[low];&nbsp;&nbsp;&nbsp;&nbsp;//数组的第一个作为中轴&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">10</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;while&nbsp;(low &lt; high) {&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">11</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;while&nbsp;(low &lt; high &amp;&amp; list[high] &gt;= tmp) {&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">12</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">15</p> </td> 
   <td style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;list[low] = list[high];&nbsp;&nbsp;&nbsp;//比中轴小的记录移到低端&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">16</p> </td> 
   <td style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;while&nbsp;(low &lt; high &amp;&amp; list[low] &lt;= tmp) {&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">19</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;list[high] = list[low];&nbsp;&nbsp;&nbsp;//比中轴大的记录移到高端&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">20</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td colspan="2" style="width:16pt;"> <p style="margin-left:0pt;">21</p> </td> 
   <td style="width:403.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;list[low] = tmp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//中轴记录到尾&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:14.3pt;"> <p style="margin-left:0pt;">22</p> </td> 
   <td colspan="2" style="width:405.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;low;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//返回中轴的位置&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:407.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">23</p> </td> 
   <td style="width:391.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">24</p> </td> 
   <td colspan="2" style="width:393.75pt;"> <p style="margin-left:0pt;">public&nbsp;void&nbsp;_quickSort(int[] list,&nbsp;int&nbsp;low,&nbsp;int&nbsp;high) {&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">25</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(low &lt; high) {&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">26</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;middle = getMiddle(list, low, high);&nbsp;&nbsp;//将list数组进行一分为二&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">27</p> </td> 
   <td style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;_quickSort(list, low, middle -&nbsp;1);&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//对低字表进行递归排序&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">28</p> </td> 
   <td style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;_quickSort(list, middle +&nbsp;1, high);&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//对高字表进行递归排序&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">31</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">public&nbsp;void&nbsp;quick(int[] a2) {&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">32</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(a2.length &gt;&nbsp;0) {&nbsp;&nbsp;&nbsp;&nbsp;//查看数组是否为空&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">33</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;_quickSort(a2,&nbsp;0, a2.length -&nbsp;1);&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">34</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

\-进QQ群：259038500即可免费Java学习视频  
**7、归并排序**

（1）基本排序：归并（Merge）排序法是将两个（或两个以上）有序表合并成一个新的有序表，即把待排序序列分为若干个子序列，每个子序列是有序的。然后再把有序子序列合并为整体有序序列。

（2）实例：

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 9][]

**（3）用java实现**

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td colspan="2" style="width:14.3pt;"> <p style="margin-left:0pt;">03</p> </td> 
   <td style="width:403.25pt;"> <p style="margin-left:0pt;">public&nbsp;class&nbsp;mergingSort { </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:12.4pt;"> <p style="margin-left:0pt;">04</p> </td> 
   <td colspan="3" style="width:407.4pt;"> <p style="margin-left:0pt;">int&nbsp;a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:191.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">05</p> </td> 
   <td style="width:175.5pt;"> <p style="margin-left:0pt;">public&nbsp;&nbsp;mergingSort(){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">06</p> </td> 
   <td colspan="2" style="width:177.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;sort(a,0,a.length-1);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:263.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">07</p> </td> 
   <td style="width:247.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length;i++)</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">08</p> </td> 
   <td colspan="2" style="width:249.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(a[i]);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:359.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">09</p> </td> 
   <td style="width:343.5pt;"> <p style="margin-left:0pt;">}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">10</p> </td> 
   <td colspan="2" style="width:345.75pt;"> <p style="margin-left:0pt;">public&nbsp;void&nbsp;sort(int[] data,&nbsp;int&nbsp;left,&nbsp;int&nbsp;right) { </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:271.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">11</p> </td> 
   <td colspan="2" style="width:255.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;// TODO Auto-generated method stub</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">12</p> </td> 
   <td style="width:253.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;if(left&lt;right){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:275.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">13</p> </td> 
   <td style="width:259.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//找出中间索引</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">14</p> </td> 
   <td colspan="2" style="width:261.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;center=(left+right)/2;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:251.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">15</p> </td> 
   <td style="width:235.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//对左边数组进行递归</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">16</p> </td> 
   <td colspan="2" style="width:237.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sort(data,left,center);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:269.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">17</p> </td> 
   <td style="width:253.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//对右边数组进行递归</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">18</p> </td> 
   <td colspan="2" style="width:255.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sort(data,center+1,right);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:293.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">19</p> </td> 
   <td style="width:277.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//合并</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">20</p> </td> 
   <td colspan="2" style="width:279.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;merge(data,left,center,right);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">23</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">24</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">public&nbsp;void&nbsp;merge(int[] data,&nbsp;int&nbsp;left,&nbsp;int&nbsp;center,&nbsp;int&nbsp;right) { </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:287.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">25</p> </td> 
   <td style="width:271.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;// TODO Auto-generated method stub</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">26</p> </td> 
   <td colspan="2" style="width:273.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;[] tmpArr=new&nbsp;int[data.length];</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:218.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">27</p> </td> 
   <td style="width:202.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;mid=center+1;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">28</p> </td> 
   <td colspan="2" style="width:204.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;//third记录中间数组的索引</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:163.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">29</p> </td> 
   <td colspan="2" style="width:147.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;third=left;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">30</p> </td> 
   <td style="width:145.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;tmp=left;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:259.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">31</p> </td> 
   <td colspan="2" style="width:243.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;while(left&lt;=center&amp;&amp;mid&lt;=right){ </p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">32</p> </td> 
   <td style="width:241.5pt;"> <p style="margin-left:0pt;">&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:271.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">33</p> </td> 
   <td style="width:255.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;//从两个数组中取出最小的放入中间数组</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">34</p> </td> 
   <td style="width:255.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(data[left]&lt;=data[mid]){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:337.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">35</p> </td> 
   <td colspan="2" style="width:321.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmpArr[third++]=data[left++];</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">36</p> </td> 
   <td style="width:319.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}else{ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:331.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">37</p> </td> 
   <td colspan="2" style="width:315.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmpArr[third++]=data[mid++];</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">38</p> </td> 
   <td style="width:313.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:221.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">39</p> </td> 
   <td style="width:205.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">40</p> </td> 
   <td colspan="2" style="width:207.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;//剩余部分依次放入中间数组</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:281.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">41</p> </td> 
   <td style="width:265.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;while(mid&lt;=right){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">42</p> </td> 
   <td colspan="2" style="width:267.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmpArr[third++]=data[mid++];</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:185.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">43</p> </td> 
   <td style="width:169.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">44</p> </td> 
   <td colspan="2" style="width:171.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;while(left&lt;=center){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:289.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">45</p> </td> 
   <td colspan="2" style="width:273.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;tmpArr[third++]=data[left++];</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">46</p> </td> 
   <td style="width:271.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:259.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">47</p> </td> 
   <td colspan="2" style="width:243.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;//将中间数组中的内容复制回原数组</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">48</p> </td> 
   <td style="width:241.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;while(tmp&lt;=right){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:259.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">49</p> </td> 
   <td colspan="2" style="width:243.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;data[tmp]=tmpArr[tmp++];</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">50</p> </td> 
   <td style="width:241.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:319.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">51</p> </td> 
   <td colspan="2" style="width:303.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(Arrays.toString(data));</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">52</p> </td> 
   <td style="width:301.5pt;"> <p style="margin-left:0pt;">}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

**8、基数排序**

（1）基本思想：将所有待比较数值（正整数）统一为同样的数位长度，数位较短的数前面补零。然后，从最低位开始，依次进行一次排序。这样从最低位排序一直到最高位排序完成以后,数列就变成一个有序序列。

（2）实例：

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 10][]  
（3）用java实现

查看源码

打印?

<table style="margin-left:3.15pt;width:187.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">01</p> </td> 
   <td colspan="2" style="width:171.75pt;"> <p style="margin-left:0pt;">import&nbsp;java.util.ArrayList;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">02</p> </td> 
   <td style="width:169.5pt;"> <p style="margin-left:0pt;">import&nbsp;java.util.List;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:173.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">03</p> </td> 
   <td style="width:157.5pt;"> <p style="margin-left:0pt;">&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">04</p> </td> 
   <td colspan="2" style="width:159.75pt;"> <p style="margin-left:0pt;">public&nbsp;class&nbsp;radixSort { </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:11.4pt;"> <p style="margin-left:0pt;">05</p> </td> 
   <td colspan="3" style="width:408.4pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,101,56,17,18,23,34,15,35,25,53,51};</p> </td> 
  </tr> 
  <tr> 
   <td colspan="2" style="width:13.45pt;"> <p style="margin-left:0pt;">06</p> </td> 
   <td style="width:404.1pt;"> <p style="margin-left:0pt;">public&nbsp;radixSort(){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:233.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">07</p> </td> 
   <td style="width:217.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;sort(a);</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">08</p> </td> 
   <td colspan="2" style="width:219.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;a.length;i++)</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:265.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">09</p> </td> 
   <td colspan="2" style="width:249.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;System.out.println(a[i]);</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">10</p> </td> 
   <td style="width:247.5pt;"> <p style="margin-left:0pt;">}</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:247.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">11</p> </td> 
   <td colspan="2" style="width:231.75pt;"> <p style="margin-left:0pt;">public&nbsp;&nbsp;void&nbsp;sort(int[] array){&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">12</p> </td> 
   <td style="width:229.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:313.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">13</p> </td> 
   <td colspan="2" style="width:297.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//首先确定排序的趟数;&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">14</p> </td> 
   <td style="width:295.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;max=array[0];&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:337.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">15</p> </td> 
   <td colspan="2" style="width:321.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=1;i&lt;array.length;i++){&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">16</p> </td> 
   <td style="width:319.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(array[i]&gt;max){&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:301.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">17</p> </td> 
   <td colspan="2" style="width:285.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;max=array[i];&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">18</p> </td> 
   <td style="width:283.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:269.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">23</p> </td> 
   <td style="width:253.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;while(max&gt;0){&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">24</p> </td> 
   <td colspan="2" style="width:255.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;max/=10;&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">29</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;List&lt;ArrayList&gt; queue=new&nbsp;ArrayList&lt;ArrayList&gt;();&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">30</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;10;i++){&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">31</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ArrayList&lt;Integer&gt; queue1=new&nbsp;ArrayList&lt;Integer&gt;();</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">32</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;queue.add(queue1);&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:335.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">35</p> </td> 
   <td style="width:319.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//进行time次分配和收集;&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">36</p> </td> 
   <td colspan="2" style="width:321.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;i=0;i&lt;time;i++){&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:323.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">37</p> </td> 
   <td style="width:307.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">38</p> </td> 
   <td colspan="2" style="width:309.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//分配数组元素;&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.7pt;"> <p style="margin-left:0pt;">39</p> </td> 
   <td colspan="2" style="width:404.1pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;j=0;j&lt;array.length;j++){&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.7pt;"> <p style="margin-left:0pt;">40</p> </td> 
   <td style="width:401.85pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//得到数字的第time+1位数;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.05pt;"> <p style="margin-left:0pt;">41</p> </td> 
   <td colspan="2" style="width:404.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;x=array[j]%(int)Math.pow(10, i+1)/(int)Math.pow(10, i);</p> </td> 
  </tr> 
  <tr> 
   <td colspan="2" style="width:16.65pt;"> <p style="margin-left:0pt;">42</p> </td> 
   <td style="width:403.15pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ArrayList&lt;Integer&gt; queue2=queue.get(x);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:373.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">43</p> </td> 
   <td style="width:357.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;queue2.add(array[j]);</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">44</p> </td> 
   <td style="width:357.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;queue.set(x, queue2);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:389.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">45</p> </td> 
   <td style="width:373.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">46</p> </td> 
   <td colspan="2" style="width:375.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;count=0;//元素计数器;&nbsp;&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:347.25pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">47</p> </td> 
   <td style="width:331.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;//收集队列元素;&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">48</p> </td> 
   <td colspan="2" style="width:333.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(int&nbsp;k=0;k&lt;10;k++){ </p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:417.55pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">49</p> </td> 
   <td style="width:401.8pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;while(queue.get(k).size()&gt;0){ </p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">50</p> </td> 
   <td colspan="2" style="width:404.05pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ArrayList&lt;Integer&gt; queue3=queue.get(k);</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:419.8pt;"> 
 <tbody> 
  <tr> 
   <td style="width:13.9pt;"> <p style="margin-left:0pt;">51</p> </td> 
   <td colspan="3" style="width:405.9pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;array[count]=queue3.get(0);&nbsp;&nbsp;</p> </td> 
  </tr> 
  <tr> 
   <td colspan="2" style="width:15.65pt;"> <p style="margin-left:0pt;">52</p> </td> 
   <td style="width:401.9pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;queue3.remove(0);</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

<table style="margin-left:3.15pt;width:307.5pt;"> 
 <tbody> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">53</p> </td> 
   <td colspan="2" style="width:291.75pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;count++;</p> </td> 
  </tr> 
  <tr> 
   <td style="width:15.75pt;"> <p style="margin-left:0pt;">54</p> </td> 
   <td style="width:289.5pt;"> <p style="margin-left:0pt;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</p> </td> 
   <td> <p>&nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

\-进QQ群：259038500即可免费领取Java学习视频

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70]: /images/20220312/6e576f8b1d214135903cc33a22cb2eba.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 1]: /images/20220312/e199cb3ed137477e83aa3b87cfc3362e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 2]: /images/20220312/fecc65fb926f4b0c9f8a0da0b4295147.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 3]: /images/20220312/695abbfefdfb4a1eb00215281ec95a4f.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 4]: /images/20220312/14285d61a59845378517b082f498fabb.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 5]: /images/20220312/a5b7d0fb316d45f1b853a04d5701ab71.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 6]: /images/20220312/d2b696f01e7a4ec79bb08e84afe09f0e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 7]: /images/20220312/91c335a968d24c2ea25315af564e9da7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 8]: /images/20220312/a39d61cba70b43a4bbd43aeb9c63086d.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 9]: /images/20220312/033a2476a0f6475288d3beb630faca63.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ZhcnNpZ2h0MQ_size_16_color_FFFFFF_t_70 10]: /images/20220312/63757f37c9e344029a2189f33ac8e75f.png