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. 八大排序算法：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 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.

时间： 2024-10-10 08:41:57

Algorithm & Design的相关文章

Learning OpenCV Lecture 2 (Using the Strategy pattern in algorithm design)

ColorDetector.h: #include <opencv2/core/core.hpp> #include <opencv2/highgui/highgui.hpp> class ColorDetector { public: // empty constructor ColorDetector() : minDist(100) { // default parameter initialization here target[0] = target[1] = targe

An universal algorithm design of fixed length substring locating

     An universal algorithm design of fixed length substring locating Stringlocating is a very common operation not only in the SQL design but also in theclient development tools, in which functions are also supplied to realize thelocating operation,

算法设计手册（第2版）读书笔记, Springer - The Algorithm Design Manual, 2ed Steven S.Skiena 2008

The Algorithm Design Manual, 2ed 跳转至: 导航. 搜索 Springer - The Algorithm Design Manual, 2ed Steven S.Skiena 2008 目录 1 介绍 2 算法设计 3 数据结构 4 排序和搜索 5 图遍历 6 加权图 7 组合搜索与启发式 8 DP 9 Intractable问题与近似算法 10 怎样设计算法 11 数据结构 12 数值问题 13 组合问题 14 图问题:P 15 图问题:困难的 16 计算几何

AUTOML --- Machine Learning for Automated Algorithm Design.

自动算法的机器学习: Machine Learning for Automated Algorithm Design. http://www.ml4aad.org/ AutoML--降低机器学习门槛的利器: https://zhuanlan.zhihu.com/p/27792859 原文地址:https://www.cnblogs.com/hopesun/p/8158076.html

《Pearls.of.Functional.Algorithm.Design》pdf

下载地址:网盘下载 Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinato

高级算法设计讲义 Lecture Notes for Advanced Algorithm Design

(Last modification: 2012-12-17) Textbooks: (1) David Williamson, David Shmoys. The Design of Approximation Algorithms, Cambridge University Press, 2011. (2) Vijay Vazirani. Apporoximation Algorithms. Springer, 2001. (3) Rajeev Motwani, Prabhakar Ragh

Brute-force Algorithm(hdu3221)

Brute-force Algorithm Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2740    Accepted Submission(s): 728 Problem Description Professor Brute is not good at algorithm design. Once he was asked t

Havel–Hakimi algorithm（判断度数序列是否可图）

问题 J: Degree Sequence of Graph G 时间限制: 1 Sec  内存限制: 128 MB 题目描述 Wang Haiyang is a strong and optimistic Chinese youngster. Although born and brought up in the northern inland city Harbin, he has deep love and yearns for the boundless oceans. After gr

我的算法学习之路

关于 严格来说,本文题目应该是我的数据结构和算法学习之路,但这个写法实在太绕口--况且CS中的算法往往暗指数据结构和算法(例如算法导论指的实际上是数据结构和算法导论),所以我认为本文题目是合理的. 这篇文章讲了什么? 我这些年学习数据结构和算法的总结. 一些不错的算法书籍和教程. 算法的重要性. 初学 第一次接触数据结构是在大二下学期的数据结构课程.然而这门课程并没有让我入门--当时自己正忙于倒卖各种MP3和耳机,对于这些课程根本就不屑一顾--反正最后考试划个重点也能过,于是这门整个计算机专业本