Guide to Competitive Programming : learning and improving algorithms through contests /
This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programm...
| Auteur principal: | |
|---|---|
| Format: | Livre |
| Langue: | English |
| Publié: |
Cham :
Springer : c2017
|
| Collection: | Undergraduate Topics in Computer Science
|
| Sujets: | |
| Classic Catalogue: | View this record in Classic Catalogue |
Table des matières:
- Introduction
- Programming Techniques
- Efficiency
- Sorting and Searching
- Data Structures
- Dynamic Programming
- Graph Algorithms
- Algorithm Design Topics
- Range Queries
- Tree Algorithms
- Mathematics
- Advanced Graph Algorithms
- Geometry
- String Algorithms
- Additional Topics
- Appendix A: Mathematical Background.