Binary Search Code

Author: X-m7

COMP2230/bsearch.png

@@ -100,5 +100,6 @@
         \textbf{Knuth-Morris-Pratt Algorithm}: use shift table to skip characters already checked and known to not match, whole algorithm takes $O(m+n)$, shift table making takes $O(m)$\\
         \underline{\textbf{Coin-Weighing Problem}}:\\
         \includegraphics[width=\linewidth]{coinweigh.png}\\
+        \includegraphics[width=\linewidth]{bsearch.png}
     \end{multicols}
     \end{document}