PHP array bubble sort algorithm example code

Bubble Sort (Bubble Sort) is a relatively simple sorting algorithm in the field of computer science.

It repeatedly visits the sequence to be sorted, comparing two elements at a time, and swapping them if they are in the wrong order. The work of visiting the array is repeated until no more exchanges are needed, which means that the array has been sorted.

The name of this algorithm comes from the fact that larger elements will slowly "float" to the top of the array through exchange.

This article mainly introduces php arrays Bubble sort algorithm, using a simple example to analyze the implementation principles and related techniques of the PHP array bubble sort algorithm, friends in need can refer to , the details are as follows:

<?php
/*@冒泡排序算法
*/
$array=array(5,45,22,11,32,28,35,56,17,21,92);
$len=count($array);//计算数组长度
for($i=0;$i<$len-1;$i++){//需要比较$len-1轮，每一轮需要比较$len-1次
  for($j=0;$j<$len-1;$j++){//需要比较$len-1次，因为循环到最后一个数时，后面没有数可以比较了，所以循环到倒数第二个数正好
   $k=$j+1;//得到当前数的后一个数的下标,我们依次比较的是数组下标分别为0-1，1-2，3-4的数值对
   if($array[$j]>$array[$k]){//比较两数，如果前一个数比后一个大，则交换两个数的顺序
     $t=$array[$j];
     $array[$j]=$array[$k];
     $array[$k]=$t;
   }//第一次循环比较完之后，进行下一轮比较
  }
}
print_r($array);
/*理解冒泡排序的关键在于，它的比较结果是大数往后放，依次得出的是最大的数，第二大的数，第三大的数。。。依次类推*/
?>

The above is the detailed content of PHP array bubble sort algorithm example code. For more information, please follow other related articles on the PHP Chinese website!