ViewTube

Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ...

From the physical world to the virtual world, algorithms are seemingly everywhere. David J. Malan, Professor of Computer Science ...

As the John L. Loeb Associate Professor of Engineering and Applied Sciences at the Harvard John A. Paulson School of ...

In this course you will learn about algorithms and data structures, two of the fundamental topics in computer science. There are ...

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

Path-following interior point, first order methods (gradient descent).

Guest lecture: Rong Ge.

second order methods (Newton's method), path-following interior point wrap-up.

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

Learn the basics of computer science from Harvard University. This is CS50, an introduction to the intellectual enterprises of ...