Short Notes

The page contains several random short notes.

• Common sorting algorithms in Python
• Phrases: encapsulation programming, polymorphism, garbage collection...
• Dijkstra’s Algorithm: Shortest path in weighted graphs
• Kadane’s Algorithm: Maximum Subarray Sum (DP, in linear time, global max & local max)
• Floyd’s Cycle-Finding Algorithm: Fnd a loop in a linked list
• Kruskal’s Algorithm: Minimum Spanning Tree
• Prim's Algorithm: Minimum Spanning Tree (greedy, only capable to positive Weights)
• Manacher’s Algorithm: Find longest Ppalindromic substring, e.g., "abba", in linear time