Binary Search Algorithm (Searching: Algorithms & Lower Bounds)

Published on ● Video Link: https://www.youtube.com/watch?v=uVnvmrVoeuQ



Duration: 46:16
27 views
3


In this lesson we see how to solve the search problem more efficiently than linear search when the input array is sorted! This brings us to the ultimate strategy for a top-hot/too-cold guessing game, binary search. We see the algorithm and perform complexity analysis for it to see that solves the problem in O(log n) time!

Time Stamps:
0:00 Opening and recap, properties
4:32 Idea of binary search
12:22 Binary search pseudocode/algorithm
17:48 Time complexity analysis for binary search using repeated substitution
45:56 Closing


Have a beautiful day!

Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
-Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
-Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard

Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard

#ComputerScience
#Algorithms
#DataStructures







Tags:
Computer Science
Algorithms
Data Structures
Education
CompSci
CS
PageWizard
Mathematics
Accessibility
University
COMPSCI
COMP
CSCI
Western
Manitoba
StFX
Regina
binary search
binary
bisection search
guessing game
O(log n)