1
实用算法的分析与程序设计,吴文虎
2
骆吉洲，算法设计与分析，机械工业出版社
3
Anany Levitin，Introduction to the design and analysis of algorighms (算法设计与分析基础)，清华出版社
My Utilities
- vectorutil
- recursive permutation
- gcd
- factorial
- binary combinations
- my simple stack implementation in c
实用算法的分析与程序设计,吴文虎
- recurrence
- forward
- reverse
- greedy
- recursion
- divide and conquer
- enumeration
- simulation
- sequence stat
- median
骆吉洲，算法设计与分析，机械工业出版社
Anany Levitin，Introduction to the design and analysis of algorighms (算法设计与分析基础)，清华出版社
several important types of problems
- sorting problem
- searching problem
- string
- graph and network
- combination
- geonetric algorithm
- numerical problem
fundamental data structures
- linear data structures
- array
- string
- linked list
- doubly linked list
- stack
- queue
- graph
- undirected graph
- directed graph
- weighted graph
- tree
- rooted tree
- ordered tree
- set and dictionary
O() notation
chapter 2 +placeholder
- selective sort
- bubble sort
- sequential search
- brute force string matching
- nearest pair
- convex hull search
对于平面上一个点集合（有限或无限的），如果以集合中任意两点p和q为端点的线段都属于该集合， 我们说这个集合是凸的。 一个点集合S的凸包（convex hull）是包含S的最小凸集合（“最小”指S的凸包一定是所有包含S的凸集合的子集）
- Traveler Sales Problem, TSP by brute force
- TSP's matlab verification program
- TSP is NP-hard problem
- Knapsack problem, KP by brute force
- KP is also NP-hard problem
- task assign problem
- Depth-First Search
- Breadth-First Search
- coin1
- [coin2]
- [coin3]