CS50x 2025 - Lecture 3 - Algorithms

Tavsif:

Searching algorithms such as linear search and binary search, sorting algorithms including bubble sort, selection sort, and merge sort, asymptotic notation (O, Ω, Θ), and recursion are covered in this lecture. This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming. At 00:00:00, the lecture begins with an introduction. At 00:01:15, an overview is presented. At 00:07:50, searching is discussed, including linear search at 00:08:41 and binary search at 00:13:04. At 00:15:57, running time is explained. At 00:28:56, the search.c file is examined. At 00:44:29, phonebook.c is covered. At 00:49:57, structs are introduced. At 00:58:45, sorting is introduced. At 01:11:28, selection sort is covered. At 01:21:44, bubble sort is covered. At 01:32:46, recursion is discussed. At 01:38:09, iteration.c is examined. At 01:41:19, recursion.c is examined. At 01:49:06, merge sort is covered. At 02:04:07, a sort race is presented.