Linear Search (Searching: Algorithms and Lower Bounds)
3In today's video, we talk about the basics of searching. To do this, we consider first the case of an array where we only know if the element we are looking for is equal or not equal to an element/item in the array. We see a basic presentation of linear search. I must stress, that you can also present this algorithm by simply returning true (or the position found) when you find the desired value!
Time Stamps:
0:00 Opening
0:15 What is the search problem?
5:30 Idea for linear search
11:01 What is an invariant? (more for the next part)
13:55 Linear search in pseudocode.
18:39 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
#basics