CS50 2021 in HDR - Lecture 3 - Algorithms

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:17 - Algorithms
00:05:34 - Searching
00:08:17 - Big O Notation
00:12:51 - Common Running Times
00:13:18 - Asymptotic Notation
00:16:50 - Searching Lockers
00:20:46 - Linear Search
00:29:45 - Binary Search
00:37:11 - Sorting and Searching vs. Just Searching
00:41:23 - Implementing Linear Search
00:45:34 - String Comparison
00:54:28 - Storing Data in Arrays
00:59:36 - Structs
01:12:26 - Sorting
01:13:39 - Visualizing Sorts
01:26:22 - Selection Sort
01:34:28 - Bubble Sort
01:43:03 - Comparing Sorts
01:45:23 - Recursion
02:00:54 - Merge Sort
02:15:16 - Sort Race