Php two-dimensional array quick sorting algorithm implementation code, two-dimensional array algorithm

Php two-dimensional array quick sorting algorithm implementation code, two-dimensional array algorithm

Php two-dimensional array quick sorting algorithm implementation code

The basic theories of the Two-dimensional array Sorting Algorithm and the one-dimensional array sorting algorithm are the same. They both place small values in the left-changing array by comparison, and the large values in the right array by recursion respectively.

Instance code:

<?php class Bubble {   private function __construct() {   }   private static function sortt($data) {     if (count ( $data ) <= 1) {      return $data;     }     $tem = $data [0]['score'];     $leftarray = array ();     $rightarray = array ();     for($i = 1; $i < count ( $data ); $i ++) {       if ($data [$i]['score'] <= $tem ) {         $leftarray[] = $data[$i];       } else {         $rightarray[] = $data[$i];       }     }     $leftarray=self::sortt($leftarray);     $rightarray=self::sortt($rightarray);     $sortarray = array_merge ( $leftarray, array ($data[0]), $rightarray );     return $sortarray;   }   public static function main($data) {     $ardata = self::sortt ( $data );     return $ardata;   } }  $arr=array(   array('sid'=>1,'score'=>76),   array('sid'=>2,'score'=>93),   array('sid'=>3,'score'=>68.5),   array('sid'=>4,'score'=>82.5),   array('sid'=>5,'score'=>60.5) ); print_r(Bubble::main($arr)); 

If you have any questions, please leave a message or go to the community on this site for discussion. Thank you for reading this article. Thank you for your support!