Computer Science Professor at MIT · Upvoted by , M. S. Computer Science & Artificial Intelligence, Northeastern University and , M.S Computer Science, University of California, Los Angeles · Author has 228 answers and 19.2M answer views · 10y ·
First year computer science students are mainly focused on learning how to program. MIT's first algorithms course, 6.006, is therefore a pretty gentle introduction. It covers
* core concepts of runtime and asymptotic analysis
* divide and conquer
* sorting (merge sort, quicksort)
* searching (balanced binary search trees, hash tables)
* graphs (breadth and depth first search, topological sorting)
* dynamic programming (shortest paths, text justification)
That's really enough for a first year. Our next course, 6.046, dives much deeper.
319.5K views ·
View upvotes
· View 8 shares
· 1 of 11 answers
Something went wrong. Wait a moment and try again.