ANALYSIS AND DESIGN OF ALGORITHMS

Catalog description

Study of methods and techniques for the complexity analysis of computer algorithms. Design of new algorithms capable of minimizing execution time while optimizing the use of computer resources. Topics include: asymptotic analysis, greedy strategies, divide and conquer, dynamic programming, backtracking, and graph, search, and sorting algorithms.