mirror of
https://github.com/TheAlgorithms/Ruby
synced 2024-11-16 19:50:00 +01:00
25 lines
664 B
Ruby
25 lines
664 B
Ruby
# A pure Ruby implementation of a recursive linear search algorithm
|
|
|
|
def rec_linear_search(sequence, low, high, target)
|
|
raise Exception('Invalid upper or lower bound!') unless high < sequence.length && low < sequence.length
|
|
|
|
return -1 if high < low
|
|
|
|
return low if sequence[low] == target
|
|
|
|
return high if sequence[high] == target
|
|
|
|
rec_linear_search(sequence, low + 1, high - 1, target)
|
|
end
|
|
|
|
puts(rec_linear_search([0, 30, 500, 100, 700], 0, 4, 0))
|
|
# => 0
|
|
|
|
puts(rec_linear_search([0, 30, 500, 100, 700], 0, 4, 700))
|
|
# => 4
|
|
|
|
puts(rec_linear_search([0, 30, 500, 100, 700], 0, 4, 30))
|
|
# => 1
|
|
|
|
puts(rec_linear_search([0, 30, 500, 100, 700], 0, 4, -6))
|
|
# => -1
|