Main Page: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| (19 intermediate revisions by 5 users not shown) | |||
| Line 1: | Line 1: | ||
=== Notations === | === Notations === | ||
* [[ | * [[Big O notation]] | ||
* [[L' Hospital]] | * [[L' Hospital]] | ||
* [[Master theorem]] | * [[Master theorem]] | ||
* [[Asymptotic comparison of functions]] | |||
=== Problems === | === Problems === | ||
* [[Maximum matching problem]] | * [[Matchings in graphs#Cardinality-maximal matching|Maximum matching problem]] | ||
* [[Max-Flow Problems]] | * [[Max-Flow Problems]] | ||
* [[Min-Cost Flow Problems]] | * [[Min-Cost Flow Problems]] | ||
| Line 39: | Line 17: | ||
*** [[Dijkstra]] | *** [[Dijkstra]] | ||
** [[Single source single target shortest paths]] | ** [[Single source single target shortest paths]] | ||
*** [[A*]] | *** [[A*]] (Empty in old wiki) | ||
* [[Maximum spanning forest]] | * [[Maximum spanning forest]] | ||
* [[Problems on Sequences]] | * [[Problems on Sequences]] | ||
| Line 55: | Line 33: | ||
=== Coding Basics === | === Coding Basics === | ||
* [[ | * [[Inheritance]] | ||
* [[Generics]] | * [[Generics]] | ||
* [[Collections]] | * [[Collections]] | ||
| Line 77: | Line 55: | ||
=== Search Algorithms === | === Search Algorithms === | ||
* [[Binary search]] | * [[Binary search]] | ||
=== Auxillary Algorithms === | |||
* [[Pivot partitioning by scanning]] | |||
=== Manipulation === | === Manipulation === | ||
| Line 104: | Line 85: | ||
* [[B-tree: remove]] | * [[B-tree: remove]] | ||
* [[B-tree: shift key to sibling]] | * [[B-tree: shift key to sibling]] | ||
* [[B-tree: split]] | * [[B-tree: split]] | ||
* [[Binary search tree: find]] | * [[Binary search tree: find]] | ||
| Line 133: | Line 112: | ||
* [[Union-find with disjoint trees: find]] | * [[Union-find with disjoint trees: find]] | ||
* [[Union-find with lists: unite]] | * [[Union-find with lists: unite]] | ||
* [[Max-flow min-cut]] | |||
=== Flow Algorithms === | === Flow Algorithms === | ||
* [[Ford-Fulkerson]] | * [[Ford-Fulkerson]] | ||
* [[Edmonds-Karp]] | |||
=== Abstract Data Structures === | === Abstract Data Structures === | ||
*[[Network Structures]] | *[[Network Structures]] | ||
| Line 160: | Line 142: | ||
* [[Min-Max Heaps]] | * [[Min-Max Heaps]] | ||
* [[First In - First Out]] | * [[First In - First Out]] | ||
* [[First In - | * [[First In - Last Out]] | ||
* [[Directed Tree]] | * [[Directed Tree]] | ||
* [[Decision Tree]] | * [[Decision Tree]] | ||
=== Other | === Other === | ||
* [[ | * [[Model computer]] | ||
Latest revision as of 15:13, 30 November 2020
Notations
Problems
- Maximum matching problem
- Max-Flow Problems
- Min-Cost Flow Problems
- Shortest Paths Problems
- All pairs shortest paths
- Floyd-Warshall
- Bellman-Ford (DONE)
- Shortest paths by repeated squaring (variant of Bellman-Ford)
- Single source shortest paths
- Single source single target shortest paths
- A* (Empty in old wiki)
- All pairs shortest paths
- Maximum spanning forest
- Problems on Sequences
- Basic Problems on Sequences
- Find an element in a sequence (DONE)
- Insert an element in a sequence (Empty in old wiki?!)
- Median (DONE)
- Merging two sorted sequences (DONE)
- Pattern Matching
- One-dimensional string matching (DONE)
- String matching (DONE)
- Sorting
- Basic Problems on Sequences
Coding Basics
String Matching Algorithms
Sorting Algorithms
Search Algorithms
Auxillary Algorithms
Manipulation
- Array list: find
- Array list: find at position
- Array list: insert at head
- Array list: insert at position
- Array list: number
- Array list: remove
- Doubly-linked list: insert at position
- Doubly-linked list: insert at tail
- Doubly-linked list: remove
- Find element in sequence iteratively
- Find element in sequence recursively
- Hashtable: find
- Hashtable: insert
Tree Algorithms
- Depth-first search
- Breadth-first search
- B-tree: find
- B-tree: minimum
- B-tree: maximum
- B-tree: insert
- B-tree: insert and rearrange
- B-tree: merge two siblings
- B-tree: remove
- B-tree: shift key to sibling
- B-tree: split
- Binary search tree: find
- Binary search tree: minimum
- Binary search tree: maximum
- Binary search tree: insert
- Binary search tree: remove
- Binary search tree: remove node
- Binary search tree: traverse
Graph Theory
Graph Algorithms
- Dijkstra
- Kruskal
- Prim
- Bellman-Ford (DONE)
- Floyd-Warshall
- Union Find
- A*
- Alternating paths algorithm
- Johnson
- Union-find with disjoint trees: find
- Union-find with lists: unite
- Max-flow min-cut
Flow Algorithms
Abstract Data Structures
Implementations of Abstract Data Structures
- Linked list
- Array list
- Binary search tree
- Doubly-linked list
- Heap as array (DONE (Heap as Array))
- Hashtable
- Multi-way search tree
- Red-black tree
- B-tree