consistent hashing hash selection algorithm

consistent-hashing.rb

def getHash(hashes, val)
  start = 0
  finish = hashes.size - 1
  val = val % hashes[finish]
  
  if hashes[start] >= val
    return hashes[0]
  end

  mid = start
  while finish - start > 1
    mid = (start + finish) / 2
    if hashes[mid] >= val
      finish = mid
    else
      start = mid
    end
  end
  return hashes[finish]
end

hashes = [123, 1243, 3455, 53423, 343234] # sorted hash array
puts getHash(hashes, 126)