PHP数据结构之冒泡法排序

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

执行结果为：

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