$a = [1,3,6,8,12]
$b = [1,6,7,9,10,12,16]
$res = [1,1,3,6,6,7,8,9,10,12,12,16]$a = [1,3,5,6,7,8,9];
$b = [2,4,6,8,9,12];
$i = $j =0;
$res = [];
$c_a = count($a);
$c_b = count($b);
while ($i < $c_a && $j < $c_b )
{
if( $a[$i] < $b[$j]){
$res[] = $a[$i];
$i++;
}elseif ($a[$i] > $b[$j]) {
$res[] = $b[$j];
$j++;
}else {
$res[] = $a[$i];
$res[] = $a[$i];
$i++;
$j++;
}
}0 => int 1
1 => int 2
2 => int 3
3 => int 4
4 => int 5
5 => int 6
6 => int 6
7 => int 7
8 => int 8
9 => int 8
10 => int 9
11 => int 9
function array_merge_sorted($first, $second)
{
$out = [];
for (
$f = 0, $s = 0,
$firstLength = count($first),
$secondLength = count($second);
$f < $firstLength || $s < $secondLength;
) {
if (!isset($first[$f])) {
$out[] = $second[$s];
++$s;
} elseif (!isset($second[$s])) {
$out[] = $first[$f];
++$f;
} elseif ($first[$f] > $second[$s]) {
$out[] = $second[$s];
++$s;
} else {
$out[] = $first[$f];
++$f;
}
}
return $out;
}
function merge_ordered(array $a, array $b) {
$aLen = count($a);
$bLen = count($b);
$resultLen = $aLen + $bLen;
$result = new SplFixedArray($resultLen);
for(
$i = 0, $aIdx=0, $bIdx=0;
$i < $resultLen;
$i++
) {
if ($aIdx === $aLen || ($bIdx < $bLen && $a[$aIdx] > $b[$bIdx])) {
$result[$i] = $b[$bIdx++];
} else {
$result[$i] = $a[$aIdx++];
}
}
return $result; // Ахтунг SplFixedArray вместо array!
}
Средний
Простой