Binary Search in Ruby

Welcome to the Binary Search in Ruby page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

def binary_search(array, key)
    left = 0
    right = array.length - 1

    while (left <= right)
        mid = (left + right) / 2

        if (array[mid] == key)
            return "true"
        elsif(array[mid] < key)
            left = mid + 1
        else
            right = mid - 1
        end
    end
    return "false"
end

# Validation of inputs
if ARGV.length != 2 || ARGV[0].empty? || ARGV[1].empty?
    puts 'Usage: please provide a list of sorted integers ("1, 4, 5, 11, 12") and the integer to find ("11")'
else
    array = ARGV[0].split(',').map(&:strip).map(&:to_i)
    key = ARGV[1].to_i
    
    if array != array.sort
        puts 'Usage: please provide a list of sorted integers ("1, 4, 5, 11, 12") and the integer to find ("11")'
    else
        puts binary_search(array, key)
    end
end

Binary Search in Ruby was written by:

• Tyler Gilmore

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.