Primitive Binary Search (cs, js, php)

IterativeBinarySearch.cs

public int BinarySearchIterative(int[] array, int target)
{
    int left = 0;
    int right = array.Length - 1;

    while (left <= right)
    {
        int mid = left + (right - left) / 2;

        if (array[mid] == target)
        {
            return mid;
        }
        else if (array[mid] < target)
        {
            left = mid + 1;
        }
        else
        {
            right = mid - 1;
        }
    }

    return -1; 
}

IterativeBinarySearch.js

function binarySearchIterative(array, target) {
    let left = 0;
    let right = array.length - 1;

    while (left <= right) {
        let mid = Math.floor(left + (right - left) / 2);

        if (array[mid] === target) {
            return mid;
        } else if (array[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    return -1;
}

IterativeBinarySearch.php

<?php 
function binarySearchIterative($array, $target) {
    $left = 0;
    $right = count($array) - 1;

    while ($left <= $right) {
        $mid = floor($left + ($right - $left) / 2);

        if ($array[$mid] == $target) {
            return $mid;
        } else if ($array[$mid] < $target) {
            $left = $mid + 1;
        } else {
            $right = $mid - 1;
        }
    }

    return -1;
}
?>

RecursiveBinarySearch.cs

public int BinarySearchRecursive(int[] array, int target, int left, int right)
{
    if (right >= left)
    {
        int mid = left + (right - left) / 2;

        if (array[mid] == target)
        {
            return mid;
        }
        else if (array[mid] > target)
        {
            return BinarySearchRecursive(array, target, left, mid - 1);
        }
        else
        {
            return BinarySearchRecursive(array, target, mid + 1, right);
        }
    }

    return -1;
}

RecursiveBinarySearch.js

function binarySearchRecursive(array, target, left, right) {
    if (right >= left) {
        let mid = Math.floor(left + (right - left) / 2);

        if (array[mid] === target) {
            return mid;
        } else if (array[mid] > target) {
            return binarySearchRecursive(array, target, left, mid - 1);
        } else {
            return binarySearchRecursive(array, target, mid + 1, right);
        }
    }

    return -1;
}

RecursiveBinarySearch.php

<?php 
function binarySearchRecursive($array, $target, $left, $right) {
    if ($right >= $left) {
        $mid = floor($left + ($right - $left) / 2);

        if ($array[$mid] == $target) {
            return $mid;
        } else if ($array[$mid] > $target) {
            return binarySearchRecursive($array, $target, $left, $mid - 1);
        } else {
            return binarySearchRecursive($array, $target, $mid + 1, $right);
        }
    }

    return -1;
}
?>