CS50x 2023 - Lecture 3 - Algorithms

preview_player
Показать описание
***

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:12 - Algorithms
00:06:17 - Linear Search
00:11:52 - Binary Search
00:18:35 - Running Time
00:28:48 - search.c
00:48:29 - structs
00:58:52 - Sorting
01:02:10 - Selection Sort
01:07:09 - Bubble Sort
01:10:45 - Comparing Algorithms
01:27:09 - Recursion
01:44:08 - Merge Sort
01:58:34 - Tradeoffs
01:59:51 - Sort Race

***

HOW TO SUBSCRIBE

HOW TO TAKE CS50

HOW TO JOIN CS50 COMMUNITIES

HOW TO FOLLOW DAVID J. MALAN

***

CS50 SHOP

***

LICENSE

CC BY-NC-SA 4.0
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Public License

David J. Malan
Рекомендации по теме
Комментарии
Автор

Best professor in the world for people who can never afford nor get into Harvard. For people in every corner of the world who wants to learn Computer science. Thank you Dr Malan

pclalramenga
Автор

I find listening to Malen's lectures on the same topics to be engaging and stimulating, rather than tedious or monotonous. Professor Malen's delivery and expertise are truly captivating, and I hold great admiration for his work.

AHMAD-yoih
Автор

Hard concepts simply broken of the best

josey
Автор

Wish lectures were like this in school, you have made me fall in love with Algorithms. I used to be scared.

samueljaja
Автор

"I merge the left half and the right half of the right half of the left half" has got to be my favorite quote of the CS50 lectures so far

thisisitthisiswhat
Автор

1:05:31 There shouldve been a few more swaps as the girl holding 5, didn't swap with the girl holding 4. She moved down one spot. So 4 and 5 will swap, 6 will swap with 5 then switch with 7

richardatkins
Автор

Thanks Harvard and cs50 for making education for everyone "Free and accessible". Thank you Professor David for such an eloquent and immersive way of teaching.
Thank you ChatGPT for coming up with generalized definitions and examples of each concept.

shakeelahmed
Автор

I wish every professor was like you, thank you for this.

cliff_doyle
Автор

"There is a comfort in conformity, a security in control, that is appealing. There is a thrill in domination, and we are all secretly attracted to Algorithm." - CS 50 Shades of Gray

csmemepage
Автор

One of the best teacher I have ever seen in my life. Hats off to you Sir!

hammadawan
Автор

I've finished my Undergraduate program in Computer science Engineering. I wish my teachers had made things this simple to understand. Literally my low level concepts are getting cleared here in this CS50.

.am
Автор

The explanation of recursion followed by the merge sort was mind blowing!

marshallsmith
Автор

22:31 O representation of algos
23:08 order of linear search ; we dont care about that level of precision
27:00 The REASON behind why we use O and Omega in algos
34:03 you can NOT compare two strings using == <string.h>
37:14 Segmentation Fault

52:30 Going inside structs
57:18 U cant set default values / INITIALISE variables inside structs

AARYAJAIN-uc
Автор

The way you explain is so detailed while being fun and completely not boring

DarkDevilVaqif
Автор

I love this! I used to watch his lectures back in 2013 when I started learning to code.

realjeetpatel
Автор

1:03:50 y 1:06:00 selection sort 1:07:35 bubble sort 1:24:35 comparación de los tipos de sorts 1:44:35 merge sort 1:59:49 comparando las 3: selection, bubble y merge sort

fernandocortes
Автор

This guy is a master of his craft, his Anthropomorphization of these concepts is an immensely powerful teaching tool.

FriedBananas
Автор

I wish we could hear students' questions. Thank you anyway David. Awesome lecture as always...

ismaildincer
Автор

Huge thx from S.Korea. We are living in an era which I can take a Harvard lecture for free at the very opposite of the planet.

moju
Автор

This guy is an incredible teacher!... he could teach eskimos abut snow!

GRDwashere