Complexity and Correctness of Linear Search (Searching)

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



Duration: 30:17
40 views
3


In today's lesson we learn how we can prove linear search is a correct algorithm, it solves the search problem. After this, I sketch out how we can compute the time complexity of linear search.

Time Stamps:
0:00 Opening, recap
0:36 invariant for linear search
6:49 Proof of correctness (sketch) of linear search
24:53 Time complexity of linear search

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
Linear Search
Proof of correctness
correctness
correct
O(n)
linear time