Difference between revisions of "Code Archive"
From Ubcacm
| Line 3: | Line 3: | ||
* [[CodeArchive BPTShort|Bipartite Matching]] | * [[CodeArchive BPTShort|Bipartite Matching]] | ||
* [[CodeArchive BigIntSqrt|Big Integer Square Root]] | * [[CodeArchive BigIntSqrt|Big Integer Square Root]] | ||
| − | * [[CodeArchive | + | * [[CodeArchive BinaryIndexedTree|Binary Indexed Tree]] |
* [[CodeArchive ChineseRemainderTheorem|Chinese Remainder Theorem]] | * [[CodeArchive ChineseRemainderTheorem|Chinese Remainder Theorem]] | ||
| − | * [[CodeArchive | + | * [[CodeArchive CircleBoundaryTraversal|Circle Boundary Traversal]] |
* [[CodeArchive EulerCircuit|Euler Circuit]] | * [[CodeArchive EulerCircuit|Euler Circuit]] | ||
* [[CodeArchive ExpressionEvaluation|Expression Evaluation (Parsing)]] | * [[CodeArchive ExpressionEvaluation|Expression Evaluation (Parsing)]] | ||
| Line 16: | Line 16: | ||
* [[CodeArchive MinCostMaxFlow|Minimum Cost Maximum Flow]] | * [[CodeArchive MinCostMaxFlow|Minimum Cost Maximum Flow]] | ||
* [[CodeArchive MinEnclosingSphere|Minimum Enclosing Sphere]] | * [[CodeArchive MinEnclosingSphere|Minimum Enclosing Sphere]] | ||
| − | * [[CodeArchive | + | * [[CodeArchive NQueen|N Queen problem]] |
* [[CodeArchive Simplex|Simplex]] | * [[CodeArchive Simplex|Simplex]] | ||
* [[CodeArchive SuffixTree|Suffix Tree]] | * [[CodeArchive SuffixTree|Suffix Tree]] | ||
Latest revision as of 22:18, 29 January 2007
- 3D Gemoetry
- All Pair Minimum Cut
- Bipartite Matching
- Big Integer Square Root
- Binary Indexed Tree
- Chinese Remainder Theorem
- Circle Boundary Traversal
- Euler Circuit
- Expression Evaluation (Parsing)
- Extended GCD
- Geometry
- Geometry 3D (Yury's version)
- Linear Algebra
- General Graph Matching
- Maximum Flow (Short Versions)
- Minimum Cost Maximum Flow
- Minimum Enclosing Sphere
- N Queen problem
- Simplex
- Suffix Tree
