Binary search on a Seq

binarysearch

def search [T <% Ordered[T]] (s: Seq[T], elem: T): Boolean = {
  var low = 0
  var high = s.length - 1
  while (low <= high) {
    val mid = (low + high) / 2
    if (s(mid) == elem) {return true}
    if (elem < s(mid)) {high = mid-1}
    if (elem > s(mid)) {low = mid+1}
  }
  false
}