Main Page: Difference between revisions
Jump to navigation
Jump to search
(→To Do) |
|||
| Line 9: | Line 9: | ||
* [[Asymptotic notation]] | * [[Asymptotic notation]] | ||
* [[L' Hospital]] | * [[L' Hospital]] | ||
=== Problems === | |||
* [[Maximum matching problem]] | |||
* [[Max-Flow Problems]] | |||
* [[Min-Cost Flow Problems]] | |||
* [[Shortest Paths Problems]] | |||
** [[All pairs shortest paths]] | |||
** [[Single source shortest paths]] | |||
** [[Single source single target shortest paths]] | |||
* [[Maximum spanning forest]] | |||
* [[Problems on Sequences]] | |||
** [[Basic Problems on Sequences]] | |||
*** [[Find an element in a sequence]] | |||
*** [[Insert an element in a sequence]] | |||
*** [[Median]] | |||
*** [[Merging two sorted sequences]] | |||
** [[Pattern Matching]] | |||
*** [[One-dimensional string matching]] | |||
*** [[String matching]] | |||
** [[Sorting]] | |||
*** [[Sorting based on pairwise comparison]] | |||
*** [[Sorting Sequences of Strings]] | |||
=== Coding Basics === | === Coding Basics === | ||
* [[Heritage]] | * [[Heritage]] | ||
Revision as of 22:59, 11 September 2014
News
- [math]\displaystyle{ LaTeX }[/math] available now!
- ToDo List added
- Every content has to be in English!
- Syntaxhighlight
To Do
Notations
Problems
- Maximum matching problem
- Max-Flow Problems
- Min-Cost Flow Problems
- Shortest Paths Problems
- Maximum spanning forest
- Problems on Sequences
Coding Basics
String Matching Algorithms
Sorting Algorithms
Search Algorithms
Tree Algorithms
- Depth-First Search
- Breadth-First Search
- B-Tree Rotate
- B-Tree Merge
- B-Tree Split
- Binary Search Tree Traverse
Graph Theory
Graph Algorithms
Flow Algorithms
Data Structures
- Linked List
- Array List
- First In - First Out
- First In - Ieast Out
- Double Linked List
- Heaps
- Min-Max Heaps
- Hash Table
- Directed Tree
- Binary Search Tree
- B-Trees
- Decision Tree
- Red-Black Tree
- Graphs
Other Algorithms (LOCKED)
- Alternating paths algorithm
- Cyclic Redundancy Check
- Eulcid
- Gauss
- Fast Fourier Transformation
- Bresenham
- Round Robin
- Seperate and Conquer
- Message-Digest Algorithm
- Secure Hash Algorithm
- Sequent calculus
- Resolution calculus
- Cocke-Younger-Kasami Algorithm
- Distance Vector Routing
- Link State Round
- Z Buffer Algorithm
- Marching Squares
- Marching Cubes
- Bottom-Up Heapsort
- Radixsort
- Median Cut
- Pancake sorting
- Karnaugh-Veitch Diagramm
- Delanuay Triangulation
- Backtracking