O(log n) runtime with Binary Search - Big O Notation Examples

Data Structures and Algorithms Basics series: Logarithmic Runtime with Binary Search - Big O Notation Examples.- This video explains the binary search and analyzes its runtime. For more information check out the blog post at https://adrianmejia.com/most-popular-algorithms-time-complexity-every-programmer-should-know-free-online-tutorial-course/. Another resource is: - ? Data Structure and Algorithms in JS book: https://books.adrianmejia.com/dsajs-data-structures-algorithms-javascript/