roninCode

def binary_search(item, array)
  min = 0 
  max = array.length
  middle = (min + max) / 2
  count = 0
  while min <= max
    if array[middle] == item
      count += 1
      p "count #{count}"
      p "Your item is at index: #{middle}"

roninCode

def linear_search(item, array)
  i = 0
  count = 0 
  while i < array.length
    count += 1
    p "count #{count}"
    if array[i] == item
      p "Your item is at index: #{i}"
      return i
    end

roninCode

def linear_search(item, array)
  i = 0
  steps = 0 
  while i < array.length
    steps += 1
    p "steps: #{steps}"
    if array[i] == item
      p "Your item is at index: #{i}"
      return i
    end

roninCode

numbers = [ 1, 2, 3, 4, 5]

numbers.each do |num|
  puts num
end

# Will log:
# 1
# 2
# 3