CS50 2019 - Lecture 3 - Algorithms

From the creator

TABLE OF CONTENTS 00:00:00 - Introduction 00:01:22 - Weeks 2 Recap 00:02:46 - Algorithms Demo 00:04:05 - Algorithms Demo (Linear Search) 00:06:14 - Algorithms Demo (Binary Search) 00:08:34 - Linear Search 00:09:44 - Binary Search 00:11:02 - Efficiency 00:14:03 - Big O and Omega Notation 00:18:39 - numbers.c 00:21:11 - names.c 00:26:14 - phonebook.c 00:31:40 - typedef (phonebook.c) 00:37:21 - Sorting Demo 00:43:45 - Bubble Sort 00:48:08 - Selection Sort 00:56:45 - Algorithm Running Times 01:01:56 - Elections 01:03:38 - Recursion 01:06:13 - iteration.c 01:10:28 - recursion.c 01:17:10 - Merge Sort 01:26:18 - Theta Notation 01:27:06 - Random (Visualization) TOPICS * Searching * Linear Search * Binary Search * Sorting * Bubble Sort * Selection Sort * Insertion 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. Demanding, but definitely doable. Social, but educational. A focused topic, but broadly applicable skills. CS50 is the quintessential Harvard course. FALL 2019 https://www.youtube.com/playlist?list=PLhQjrBD2T381L3iZyDTxRwOBuUt6m1FnW *** HOW TO SUBSCRIBE http://www.youtube.com/subscription_center?add_user=cs50tv HOW TO TAKE CS50 edX: https://cs50.edx.org/ Harvard Extension School: https://cs50.harvard.edu/extension Harvard Summer School: https://cs50.harvard.edu/summer OpenCourseWare: https://cs50.harvar

Published 2019-10-07 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.