Php tests

test1.php

<?php

/*
Challenge #1:

Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements.

moveZeros([false, 1, 0, 1, 2, 0, 1, 3, "a"]) 
  // returns [false, 1, 1, 2, 1, 3, "a", 0, 0]

*/

function moveZeros($arr) {
	
   $count = 0;
	
   $n = sizeof($arr);
    
    for ($i = 0; $i < $n; $i++) {
		
        if ($arr[$i] != 0) {
			
            $arr[$count++] = $arr[$i]; 
			
          }
     }
 
    // Shift non-zeros to the front 
    
    while ($count < $n) {
		
        $arr[$count++] = 0;
		
    }

    return $arr;
}



print_r(moveZeros([false, 1, 0, 1, 2, 0, 1, 3, "a"]));

test2.php

<?php

/*

Write a function maxPair(A) that takes a list A, and returns the 2 integers in the array, A, that make up a pair with the highest sum.

e.g. maxPair([10, 5, 6, 3, 9]) returns [10, 9] or [9, 10] (whichever order)
*/


function maxPair($A) {



$last = max($A);

$second = max(array_diff($A, [$last]));
	
return [$last, $second];
	
}

#test

$A = [10, 5, 6, 3, 9];

print_r(maxPair($A));