CS50x 2025 - Lecture 3 - Algorithms

Description:

*** Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: O, Ω, Θ. Recursion. *** This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming. *** TABLE OF CONTENTS 00:00:00 - Introduction 00:01:15 - Overview 00:07:50 - Searching 00:08:41 - Linear Search 00:13:04 - Binary Search 00:15:57 - Running Time 00:28:56 - search.c 00:44:29 - phonebook.c 00:49:57 - Structs 00:58:45 - Sorting 01:11:28 - Selection Sort 01:21:44 - Bubble Sort 01:32:46 - Recursion 01:38:09 - iteration.c 01:41:19 - recursion.c 01:49:06 - Merge Sort 02:04:07 - Sort Race *** HOW TO SUBSCRIBE HOW TO TAKE CS50 edX: Harvard Extension School: Harvard Summer School: OpenCourseWare: HOW TO JOIN CS50 COMMUNITIES Discord: Ed: Facebook Group: Faceboook Page: GitHub: Gitter: Instagram: LinkedIn Group: LinkedIn Page: Medium: Quora: Reddit: Slack: Snapchat: SoundCloud: Stack Exchange: Telegram: Threads: TikTok: Twitter: Twitter Community: YouTube: HOW TO FOLLOW DAVID J. MALAN Facebook: GitHub: Instagram: LinkedIn: Quora: Threads: TikTok: Twitter: *** CS50 SHOP *** LICENSE CC BY-NC-SA 4.0 Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Public License David J. Malan [email protected]