Main Page: Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
== To Do == | == To Do == | ||
== Notations == | === Notations === | ||
* [[Asymptotic notation]] | * [[Asymptotic notation]] | ||
* [[L' Hospital]] | * [[L' Hospital]] | ||
Revision as of 14:32, 10 September 2014
News
- [math]\displaystyle{ LaTeX }[/math] available now!
- ToDo List added
- Every content has to be in English!
To Do
Notations
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 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
- 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