binarySearch

binarySearch.scala

def binarySearch(keys: Seq[Int],timestamp:Int): Int = {
    val seq = keys.toSeq.sorted
    var l = 0
    var r = seq.size - 1
    while (l <= r) {
      val m = l + ((r - l) >> 1);
      val p = seq(m)
      if (p > timestamp) {
        r = m - 1
      } else {
        l = m + 1
      }
    }
    //this is used when not found the element, return the next value that is cloest to the given value
    if (l > 0) seq(l - 1) else -1


  }