Algorithm 算法
Created|Updated|编程
|Word count:7|Reading time:1min|Post View:1
距离文章编辑已经过去了 937 天，实际情况可能有所变动。
Author: EdNovas
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.
Related Articles
Comment
Catalog
- 1. Cut property
- 2. Greedy MST Algorithm
- 3. Prim’s Algorithm
- 4. Kruckal’s Algorithm
- 5. Boruvka’s Algorithm
- 6. Disjoint Set (Union-Find)
- 7. Proposition
- 8. Union-Rank
- 9. BFS (solution for unweighted graph)
- 10. Path Relaxation Property
- 11. Weighted DAG (Directed Acyclic Graph)
- 12. Dijkstra’s Algorithm(A greedy algorithm)
- 13. Bellman-Ford Algorithm
- 14. Floyd-Marshall Algorithm
- 15. Ford-Fulkerson Algorithm
- 16. Blocking-flow Algorithm
- 17. Quickselect
- 18. Probability
- 19. Dictionary
- 20. Unordered list
- 21. Ordered list
- 22. Balanced binary search tree
- 23. Direct-address table
- 24. Hash tables
- 24.1. Collision
- 24.2. Not a natrual number
- 24.3. Handling collisions
- 24.4. Chaining
- 24.5. Operations
- 24.6. Load factor
- 24.7. Assumption: Simple uniform hashing
- 24.8. Expected time for unsuccessful search
- 24.9. Expected time for successful search
- 24.10. Design hash function
- 24.11. Universal hashing
- 24.12. Open addressing
- 24.13. Linear probing
- 24.14. Quadratic probing
- 25. Double hashing
- 26. Amortized Analysis
- 27. The peril of per-operation worst-case analysis
- 28. Aggregate analysis
- 29. Accounting method
- 30. Incrementing Binary Counter Example
- 31. Dynamic tables
- 32. Brute-force substring search
- 33. Rabin-Karp fingerprint search
- 34. Efficiently computing the hash function
- 35. Rabin-Karp substring search example
- 36. Rabin-Karp analysis
- 37. Substring search————Knuth-Morris-Pratt
- 38. KMP substring search analysis
- 39. Greedy Algorithms
- 40. Scheduling to minimizing lateness
- 41. Optimal caching
- 42. Keep updating……