Abstract:
Contenido: 1. Preliminaries -- 2. Elementary algorithmics -- 3. Asymptotic notation -- 4. Analysis of algorithms -- 5. Some data structures -- 6. Greedy algorithms -- 7. Divide-and-conquer -- 8. Dynamic programming -- 9. Exploring graphs -- 10. Probabilistic algorithms -- 11. Parallel algorithms -- 12. Computacional complexity -- 13. Heuristic and approximate algorithms.