ViewTube

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: O, Ω, ...

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

Abstract Data Types. Queues, Stacks. Linked Lists. Trees, Binary Search Trees. Hash Tables. Tries. *** This is CS50, Harvard ...

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

Data structures and algorithms only matter for the data engineering interview they don't really matter that much in the actual data ...

Computer Science. Computational Thinking. Problem Solving: Inputs, Outputs. Representation: Unary, Binary, Decimal, ASCII, ...

... requests and decides which server they should go to based on some algorithm in this simple example we're using an algorithm ...

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

There's a reason why Python uses Timsort.

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

This is an example of how to solve for the greatest common divisor of 45 and 210 by looking at remainders. Thanks for watching!

An informal capture from the CUDA mode hackathon today. https://github.com/karpathy/llm.c.