Implementation of useful algorithms into runnable and tested computer codes. Designed using imperative knowledge to understand and correctly solve problems. Analyzed using declarative knowledge to do optimizations and discover better solutions.
Imperative knowledge needs practice and experience, so i code. Declarative knowledge needs strong understanding in mathematical abstraction and rigor, so i never satisfied if designed algorithm do not reach logarithmic time.
- Intoduction
- Union Find
- Analysis of Algorithm
- Stack and Queue
- Elementary Sort
- Merge Sort
- Divide and Conquer
- Priority Queue
- Solving Puzzle
- Binary Search Tree
- Balanced Search Tree
- Undirected Graph
- Elementary Symbol Table
- Hash Table
- Searching Application
- Geometric Search
- Directed Graph
- WordNet
- Minimum Spanning Tree
- Page Rank Algorithm
- Shortest Path
- Max Flow
- String Sort
- Trie
- Substring Search
- Regular Expression
- Data Compression
- Reduction
- Linear Programming
- Intractability
- Sort Experiment
- String Matching Algorithms and Their Applicability in Various Applications
- An O(ND) Difference Algorithm and Its Variations
- A Locally Adaptive Data Compression Scheme.pdf
- 3SUM