PHP数据结构之冒泡法排序

<?php
1.     $array = array(13,15,6,10,20,6,3,19);
2.     $count = count($array);
3.     $n = $e = 0;
4.     for($i = 0; $i < $count; $i++)
5.     {
6.             for($j = $i + 1; $j < $count; $j++)
7.             {
8.                 $n++;
9.                 if($array[$j] < $array[$i]){
10.                     $e++;
11.                     $tmp = $array[$i];
12.                     $array[$i] = $array[$j];
13.                     $array[$j] = $tmp;  
14.                 }  
15.             }
16.     }
17.     print_r($array);
18.     echo "共循环{$n}次，共执行{$e}次数据交换";
19. ?>

执行结果为：

Array ( [0] => 3 [1] => 6 [2] => 6 [3] => 10 [4] => 13 [5] => 15 [6] => 19 [7] => 20 )
1. 共循环28次，共执行14次数据交换