【Perl】常见数据结构与算法

#二分查找
use strict;

sub binary_search {
    my ($target, @v) = @_;
    my $left = 0;
    my $right = @v - 1;
    while ($left < $right) {
        my $mid = ($left + $right) >> 1;
        if ($v[$mid] >= $target) {
            $right = $left;
        } else {
            $left = $mid + 1;
        }
    }
    $left;
}

my $left = binary_search(8, (1, 3, 5, 8));
print $left;