Algorithm & Design

-! 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. Eight sorting algorithms: http://www.cricode.com/3212.html

7. string SEARCH: KMP vs. Boyer-Moore vs. rk

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 specified Ric prop

11 .? Rmq

13. *

14. Joseph circle: Winner is who call1. So f [I] = (F [I-1] + k) % N

[Optional]

A. * digital DP?

B. Non-deterministic primality testing: Miller-Rabin, solovay-strassen etc.

Algorithm & Design