Checkpoint for possible future talk.

Author: sean-parent

presentations/2007-07-25-possible-future/2007-07-25-possible-future.ppt

@@ -20,3 +20,18 @@ int* binary_search_insert_position(int* first, int* last, int x) {
     }
     return first;
 }
+
+int binary_search(int x[], int n, int v) {
+    int l = 0;
+    int u = n - 1;
+
+    while (true) {
+        if (l > u) return -1;
+
+        int m = (l + u) / 2;
+
+        if (x[m] < v) l = m + 1;
+        else if (x[m] == v) return m;
+        else /* (x[m] > v) */ u = m - 1;
+    }
+}