Main Page
(Difference between revisions)
(Added a link to help.) |
(Bruteforce -> Exhaustive Search.) |
||
| Line 7: | Line 7: | ||
#[[Ad Hoc]] | #[[Ad Hoc]] | ||
#[[Sorting]] | #[[Sorting]] | ||
| − | #[[ | + | #[[Exhaustive Search]] |
#[[Graph Theory]] | #[[Graph Theory]] | ||
#[[Dynamic Programming]] | #[[Dynamic Programming]] | ||
Revision as of 17:49, 30 December 2004
Contents |
The Algorithmist
The Algorithmist is a resource dedicated to anything algorithms - from the practical realm, to the theoretical realm. There are also links and explanation to problemsets.
Categories
- Simulation
- Ad Hoc
- Sorting
- Exhaustive Search
- Graph Theory
- Dynamic Programming
- Greedy
- Computational Geometry
- Number Theory
Problemsets
UVa Problemset - http://acm.uva.es/p - The Valladolid University Online Judge. Over N problems, for a reasonable value of N. The problems are culled from old contests, and online contests.
ACM-ICPC Live Archive - http://acmicpc-live-archive.uva.es/nuevoportal/ - The 2000's ACM-ICPC Live Archive Around the World. Contains actual problems from regionals and finals from 2000 on.
How you can help!
Anyone can help: Register for an account, and edit away! For more details, refer to Help. Thanks!
