php小算法总结

<?php
$arr1=array(2,5,7,9,12);
$arr2=array(3,4,6,8,10,11);
function merge_sort($arr1,$arr2){
    $len1=count($arr1);
    $len2=count($arr2);
    $arr=array();
    $i=$j=0;
    while($i<$len1&&$j<$len2){
        if($arr1[$i]<=$arr2[$j]){
            $arr[]=$arr1[$i++];
        }else{
            $arr[]=$arr2[$j++];
        }
    }
    while($i<$len1)
        $arr[]=$arr1[$i++];
    while($j<$len2)
        $arr[]=$arr2[$j++];

    return $arr;
}

print_r(merge_sort($arr1,$arr2));