(Undergraduate Topics In Computer Science) Antti Laaksonen Guide To Competitive Programming Learning And%

Guide-to-Competitive-Programming-Learning-and-improving-Algorithms-through-Cons

Antti%20Laaksonen-Guide%20to%20Competitive%20Programming.%20Learning%20and%20improving%20Algorithms%20through%20Cons-Springe

User Manual:

Open the PDF directly: View PDF .
Page Count: 283 [warning: Documents this large are best viewed by clicking the View PDF Link!]

Scroll down to view the document on your mobile browser.

Preface
Contents
Introduction
- What is Competitive Programming?
- About the Book
- CSES Problem Set
- Other Resources
ProgrammingTechniques
- Language Features
- Recursive Algorithms
- Bit Manipulation
Efﬁciency
- Time Complexity
- Examples
Sorting & Searching
- Sorting Algorithms
- Solving Problems by Sorting
- Binary Search
Data Structures
- Dynamic Arrays
- Set Structures
- Experiments
Dynamic Programming
- Basic Concepts
- Further Examples
Graph Algorithms
- Basics of Graphs
- Graph Traversal
- Shortest Paths
- Directed Acyclic Graphs
- Successor Graphs
- Minimum Spanning Trees
Algorithm Design Topics
- Bit-Parallel Algorithms
- Amortized Analysis
- Finding Minimum Values
Range Queries
- Queries on Static Arrays
- Tree Structures
Tree Algorithms
- Basic Techniques
- Tree Queries
- Advanced Techniques
Mathematics
- Number Theory
- Combinatorics
- Matrices
- Probability
- Game Theory
Advanced Graph Algorithms
- Strong Connectivity
- Complete Paths
- Maximum Flows
- Depth-First Search Trees
Geometry
- Geometric Techniques
- Sweep Line Algorithms
String Algorithms
- Basic Topics
- String Hashing
- Z-Algorithm
- Sufﬁx Arrays
Additional Topics
- Square Root Techniques
- Segment Trees revisited
- Treaps
- Dynamic Programming Optimization
- Miscellaneous
- Sum Formulas
Mathematical Background
- Sets
- Logic
- Functions
- Logarithms
- Number Systems
Refs
Index

Navigation menu