PHP Common bubble Method and recursive sorting algorithm code

PHP Common sort bubbling and recursive sorting algorithm code

Bubble Sort algorithm
function Bubblesort ($arr)
{
$n =count ($arr);

for ($i =0; $i < $n; $i + +)
{
for ($j = $i; $j <= $n-1; $j + +)
{
if ($arr [$i]> $arr [$j])
{
$temp = $arr [$i];
$arr [$i]= $arr [$j];
$arr [$j]= $temp;

}
}
}
return $arr;

}
 //Direct insert Sort
  function insertsort ($arr)
  {
   $n =count ($arr);
    for ($i =1 $i < $n + + $i)
   {
    if ($arr [$i]< $arr [$i-1])
       {
     $tmp = $arr [$i];
     $j =0
        for ($j = $i-1; $j >=0&& $tmp < $arr [$j];--$j)
          {
       $arr [$j +1]= $arr [$j];
       }
      $arr [$j +1]= $tmp;  
   }
    }
    return $arr;
  
  } simple sort algorithm
 
  function Simplesort ($arr)
  {
  $tmp =0
  $t =0
  $n =count ($arr);
 for ($i =0 ; $i < $n + + $i)
 {
    $t = $i;
    for ($j = $i +1; $j < $n; + + $j)
      {
    if ($arr [$t]> $arr [$j])
      {
       $t = $j;
       
      }
   }
   $tmp = $arr [$i];
   $arr [$i]= $arr [$t];
   $arr [$t]= $tmp;
 
 
   
    return $arr;
   } quick Sort Algorithm
function Qsort ($array)
{
$n =count ($array);
if ($n <=1) {return $array;}

$key = $array [0];
$l =array ();
$r =array ();
Recursively sort, and then synthesize an array
for ($i =1; $i < $n; $i + +)
{
if ($array [$i]<= $key)
{
$l []= $array [$i];
}
Else
{
$r []= $array [$i];
}
}
$l =qsort ($l);
$r =qsort ($R);
Return Array_merge ($l, Array ($key), $r);

}