Lecture Outline

• Binary search is an efficient algorithm for searching for a value in a sorted data structure
• Running time of binary search is O(logn), because you eliminate half of the array each time you iterate

Lecture Recording

• https://montana.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=6683bf5b-02dc-4239-b64b-b22c016d9ca5

Lecture Slides

• Searching

Code

• BinarySearch

Click here to return to the course schedule