Ò»Öê²Ý

ÕªÒª£º $arr=array(19,7,5,1,3,10); $tmp = mergeSort($arr); print_r($tmp); function mergeSort($arr){ $start = 0; $end = count($arr)-1; if($end == 0){ return $a ÔĶÁÈ«ÎÄ

ÕªÒª£º $nums = [4, 5, 6, 3, 2, 1]; for($i=0;$i<count($nums);$i++){ $min = $i; for($j=$i+1;$j<count($nums);$j++){ if($nums[$j] < $nums[$min]){ $min = $j; } } ÔĶÁÈ«ÎÄ

ÕªÒª£º //²åÈëÅÅÐò $arr = [2, 3, 1, 6, 4, 7, 5, 9]; for($i=1;$i<count($arr);$i++){ $key = $arr[$i]; $pos = $i; while($pos > 0 && $arr[$pos-1] > $key){ $arr[$pos]= ÔĶÁÈ«ÎÄ

ÕªÒª£º $bitmap=array_fill(0,1,0); $arr =[1,4,3,6,7]; $size = PHP_INT_SIZE * 8; foreach ($arr as $key => $value){ $index = floor($value/$size); $pos = $value% ÔĶÁÈ«ÎÄ

ÕªÒª£º class Node { public $data; public $left; public $right; public function __construct($data){ $this->data=$data; } } class CreateTree{ public $tree; //¶þ ÔĶÁÈ«ÎÄ