summaryrefslogtreecommitdiff
path: root/04-13.md
diff options
context:
space:
mode:
authorlshprung <lshprung@yahoo.com>2020-04-15 09:37:07 -0700
committerlshprung <lshprung@yahoo.com>2020-04-15 09:37:07 -0700
commitd822758f67f87f62cf4f50ac09439d6c051c7e95 (patch)
tree67375f42ece8abf5d348bde0d693fa1390929a69 /04-13.md
parenta573986a27f8fbd8f87a19e7475ea4cc56b632b4 (diff)
Post-class 04/15
Diffstat (limited to '04-13.md')
-rw-r--r--04-13.md4
1 files changed, 4 insertions, 0 deletions
diff --git a/04-13.md b/04-13.md
index 937fe4a..b4ae755 100644
--- a/04-13.md
+++ b/04-13.md
@@ -293,3 +293,7 @@ bool bsearch(int a[], int n, int x){
Is binary search always better than sequential search?
Answer: It depends
- How about if the sequence is not sorted?
+
+---
+
+[04/15 ->](04-15.md)