Recursive Linear Search

𝔸𝕝𝕘𝕖𝕣

Recursive Linear Search

# 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

Try this Code

About us

We are a group of programmers helping each other build new things, whether it be writing complex encryption programs, or simple ciphers. Our goal is to work together to document and model beautiful, helpful and interesting algorithms using code. We are an open-source community - anyone can contribute. We check each other's work, communicate and collaborate to solve problems. We strive to be welcoming, respectful, yet make sure that our code follows the latest programming guidelines.