
* Typo fixed * Add MIT 6.006 * Add MIT 6.006 (En) * Add MIT 6.046 * Add MIT 6.046 * Add MIT 6.006 (en) * Add MIT 6.006 (en) * Add MIT 6.046 (en) * Add Harvard CS50P * Add Harvard CS50P * Add Harvard CS50P(En) * MIT Missing Semester timeline * CS50P added * Algorithms related courses added * Space added
985 B
985 B
MIT 6.006: Introduction to Algorithms
Descriptions
- Offered by: MIT
- Prerequisites: Introductory level courses of programming (CS50/CS61A/CS106A or equivalent)
- Programming Languages: Python
- Difficulty: 🌟🌟🌟🌟🌟
- Class Hour: 100 hours+
Probably the most precious course from the EECS department of MIT. Taught by Erik Demaine, one of the geniuses in Algorithms.
Compared with CS106B/X (Data structures and algorithms using C++), 6.006 emphasizes the algorithms more. It also covers several classical data structures such as AVL trees. You may use it to learn more about algorithms after CS106B/X.