GitHub - domarps/CMI-Algorithms: Design and Analysis of Algorithms

Prof.Madhavan Mukund, CMI

Dates : 03 January 2015 - 30 March 2015

This course covered basic concepts in the design and analysis of algorithms :

Asymptotic complexity, O() notation
Sorting and search
Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees
Design techniques: divide and conquer, greedy, dynamic programming
Data structures: heaps, union of disjoint sets, search trees
Intractability

Name		Name	Last commit message	Last commit date
Latest commit History 15 Commits
IndianFilmHeroes.cpp		IndianFilmHeroes.cpp
README.md		README.md
SMSDictionary.cpp		SMSDictionary.cpp
dividingSequences.cpp		dividingSequences.cpp
numberTriples.cpp		numberTriples.cpp
printStringsFromGrid.c		printStringsFromGrid.c

Provide feedback