CS 223 - Spring 2017. 4/26

Farewell to CS 223!

Logical problem of the day

int find2(int * keys, int target, int len){
  int high = len;
  int low = -1;

  int probe;
  while (high - low > 1){
    probe = (low + high) >> 1;
    // does the following line improve the code?
    if (keys[probe] == target) { return probe;} 
    if (keys[probe] > target) {
      high = probe;
    } else {
      low = probe;
    }
  }
  if (low == -1 || keys[low] != target) {
    return -1;
  } else {
    return low;
  }
}

(From the very fine book: Beautiful Code)

Administrivia

Lecture 24: Decision Making

Lecture 24: Vale