View/Download
The design of algorithms is studied, according to methodology and application. Methodologiesinclude: divide and conquer, dynamic programming, and greedystrategies. Applications involve: sorting, ordering andsearching, graph algorithms, geometric algorithms, mathematical(number theory, algebra and linear algebra) algorithms, and stringmatching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexityof an algorithm and the underlying data structures.NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms.Added by ruthless on 2007-02-02 13:02:21
View/Download