bluedawnstar/algorithm_study
algorithms and data structures for coding contest (designed for 'copy & paste')
C++Unlicense
Issues
- 0
Review "Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications"
#51 opened - 0
Review top tree
#50 opened - 0
Review tree-related papers
#49 opened - 1
- 0
Hashing
#47 opened - 0
- 0
Simulated Annealing
#45 opened - 1
Segment Tree Beats
#44 opened - 2
Matroid and Matroid intersection
#43 opened - 0
Zip Tree
#42 opened - 1
Implement Kirchhoff's theorem
#41 opened - 0
Matrix decomposition
#40 opened - 1
Improve FFT speed
#39 opened - 1
- 1
Implement polynomial sqrt root
#37 opened - 3
- 1
- 1
15-puzzle
#34 opened - 0
Check and implement
#33 opened - 3
Implement persistent trie
#32 opened - 0
Survey on Cactus Graph
#31 opened - 0
Fast flood-fill algorithm
#30 opened - 0
Check the materials
#29 opened - 1
Implement Left-Leaning Red-Black Trees
#28 opened - 1
- 0
- 0
Implement Binomial Heap
#25 opened - 1
Implement Skip List
#24 opened - 0
- 1
Implement Open Addressing Hash Table
#22 opened - 0
- 0
Kth shortest path
#20 opened - 1
- 1
Implement Havel-Hakimi algorithm
#18 opened - 1
- 0
Implement scheduling algorithms
#16 opened - 0
- 2
- 1
Implement Matrix functions
#13 opened - 0
- 0
Implement RegExp
#11 opened - 0
Implement SSE optimizations
#10 opened - 1
- 2
- 1
Implement "Implicit Cartesian Tree"
#7 opened - 0
Implement Skip List
#6 opened - 1
- 1
- 1
Can interval trees be improved?
#3 opened - 2
Implement Berlekamp & Kitamasa
#2 opened