This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.
Analysis of AlgorithmsUniversidad de Princeton
Acerca de este Curso
- 5 stars73,60 %
- 4 stars14,72 %
- 3 stars5,07 %
- 2 stars2,03 %
- 1 star4,56 %
Principales reseñas sobre ANALYSIS OF ALGORITHMS
Outstanding material, brilliantly conceived! It contains the essence of mathematics necessary for anyone serious about programming.
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
Excellent course with very interesting and well explained topics, for those with certain background in mathematics (and, specially, in analysis and combinatorics).
¿Cuándo podré acceder a las lecciones y tareas?
Can I earn a certificate in this course?
¿Tienes más preguntas? Visita el Centro de Ayuda al Estudiante.