Algorithm & Design
2014-11-01 01:09
357 查看
[Rush]
a. k-sum generalized
------------------------
-!1. Greedy vs. DP: http://blog.csdn.net/yelbosh/article/details/7649717. Multiple choices or not: Greedy has only 1 optimal last choice; DP picks the best among several choices (not necessarily optimal)
-2. Consistent Hashing http://blog.csdn.net/sparkliang/article/details/5279393. A ring, virtual nodes.
Database Sharding
http://blog.csdn.net/bluishglc/article/details/6161475
3. Lock-Free Programming (lock-free queue\map etc.) http://kukuruku.co/hub/cpp/lock-free-data-structures-introduction
4. 八大排序算法:http://www.cricode.com/3212.html
7. String Search:
KMP : like a DFA on pattern string itself
Boyer-Moore : comparing from the back, and stops appropriately
Rabin-Karp : incremental hash computation
8. Dijkstra Pick VIA vertex (shortest edge) GREEDILY, and then RELAX all other edges
http://www.cnblogs.com/qijinbiao/archive/2012/10/04/2711780.html
Bellman-Ford loop over VIA and DEST vertices to relax edges (able to handle negative edges)
Floyd-Warshall loop over VIA, START and DEST vertices to relax edges
[They are all 'relaxation' based algorithm, and focuses on VIA point]
8. 3 solutions to Longest Palindrome: DP\Suffix Tree\Manacher
DP: bottom-up DP
Suffix Tree solution: Longest common string between S and reverse(S) -> deepest non-leaf node
!Manacher: http://blog.csdn.net/bruce_zeng/article/details/8629572: reuse calculated palin-radius due to the symmetric prop
11. ?RMQ
13. A*
14. Joseph Circle: winner is who calls 1. so f[i] = (f[i-1] + k) % n
[ Optional ]
a. *数位dp?
b. Non-deterministic Primality Testing: Miller-Rabin, Solovay-Strassen etc.
a. k-sum generalized
------------------------
-!1. Greedy vs. DP: http://blog.csdn.net/yelbosh/article/details/7649717. Multiple choices or not: Greedy has only 1 optimal last choice; DP picks the best among several choices (not necessarily optimal)
-2. Consistent Hashing http://blog.csdn.net/sparkliang/article/details/5279393. A ring, virtual nodes.
Database Sharding
http://blog.csdn.net/bluishglc/article/details/6161475
3. Lock-Free Programming (lock-free queue\map etc.) http://kukuruku.co/hub/cpp/lock-free-data-structures-introduction
4. 八大排序算法:http://www.cricode.com/3212.html
7. String Search:
KMP : like a DFA on pattern string itself
Boyer-Moore : comparing from the back, and stops appropriately
Rabin-Karp : incremental hash computation
8. Dijkstra Pick VIA vertex (shortest edge) GREEDILY, and then RELAX all other edges
http://www.cnblogs.com/qijinbiao/archive/2012/10/04/2711780.html
Bellman-Ford loop over VIA and DEST vertices to relax edges (able to handle negative edges)
Floyd-Warshall loop over VIA, START and DEST vertices to relax edges
[They are all 'relaxation' based algorithm, and focuses on VIA point]
8. 3 solutions to Longest Palindrome: DP\Suffix Tree\Manacher
DP: bottom-up DP
Suffix Tree solution: Longest common string between S and reverse(S) -> deepest non-leaf node
!Manacher: http://blog.csdn.net/bruce_zeng/article/details/8629572: reuse calculated palin-radius due to the symmetric prop
11. ?RMQ
13. A*
14. Joseph Circle: winner is who calls 1. so f[i] = (f[i-1] + k) % n
[ Optional ]
a. *数位dp?
b. Non-deterministic Primality Testing: Miller-Rabin, Solovay-Strassen etc.
相关文章推荐
- Cloud Computing(3)_Basic MapReduce Algorithm Design_Pairs&Stripes
- Cloud Computing(4)_Basic MapReduce Algorithm Design_Computing Relative Frequencies&Secondary Sorting
- [Data Structure & Algorithm] 七大查找算法
- HDFS Append 设计文档的QA(HDFS-265:Revisit append/Questions about the "Append Design")
- 重读《Programming Pearls》之八:Algorithm Design Techniques
- [Medical Image Processing] 2. Image Binary -【OTSU Algorithm & Entropy Method】
- TSearch & TFileSearch Version 2.2 -Boyer-Moore-Horspool search algorithm
- [Mechine Learning & Algorithm] 神经网络基础
- [Algorithm]九章三:Binary Tree & Divide Conquer
- [Machine Learning & Algorithm] 随机森林(Random Forest)
- 【索引】Chapter 1. Algorithm Design :: Dynamic Programming :: Exercises: Beginner
- [Machine Learning & Algorithm]CAML机器学习系列2:深入浅出ML之Entropy-Based家族
- kruskal's algorithm.[克鲁斯卡尔算法]
- UESTC_王之迷宫 2015 UESTC Training for Search Algorithm & String<Problem A>
- UESTC_秋实大哥の恋爱物语 2015 UESTC Training for Search Algorithm & String<Problem K>
- 最近的几篇NLog相关文章 & 《The Zen of CSS Design》
- !!! Analysis & Design 很好的汇总+zcl的 UML 体会
- 向Data Structrue & Algorithm 宣战!数据结构代码库
- 高级算法设计讲义 Lecture Notes for Advanced Algorithm Design
- Data Structures and algorithm analysis—1.2.4&1.2.5Modular Arithmeti&The P Word(数据结构—模数运算&P字)