CS50x 2025 - Lecture 3 - Algorithms

Name: CS50x 2025 - Lecture 3 - Algorithms
Uploaded: 2024-09-23T20:08:56Z
Channel: CS50
Description: *** Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: O, Ω, Θ. Recursion. *** This is CS50...

CS50 · Beginner ·💻 AI-Assisted Coding ·1y ago

*** 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 - ite…

Watch on YouTube ↗ (saves to browser)

Chapters (17)

Introduction

1:15 Overview

7:50 Searching

8:41 Linear Search

13:04 Binary Search

15:57 Running Time

28:56 search.c

44:29 phonebook.c

49:57 Structs

58:45 Sorting

1:11:28 Selection Sort

1:21:44 Bubble Sort

1:32:46 Recursion

1:38:09 iteration.c

1:41:19 recursion.c

1:49:06 Merge Sort

2:04:07 Sort Race

Playlist

Uploads from CS50 · CS50 · 0 of 60

← Previous Next →