Binary search PHP implementation

php-binary-search.php

<?php

    function binarySearch($list,$itemToBeFound){
        $firstIndex = 0;
        $lastIndex = (count($list) - 1);
        $found = false;
    
        while($firstIndex <= $lastIndex && $found == false){
            $midpoint = floor(($firstIndex + $lastIndex) / 2);
            if ($itemToBeFound == $list[$midpoint]){
                $found = true;
            }else{
                if($itemToBeFound < $list[$midpoint]){
                    $lastIndex = $midpoint - 1;
                }else if($itemToBeFound > $list[$midpoint]){
                    $firstIndex = $midpoint + 1;
                }
            }
            
        }

        return $found;

    }
    //tests the function above
    $founded = binarySearch([0, 1, 2, 8, 13, 17, 19, 32, 42],19);
    var_dump($founded);
    
?>