Main Page: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
* ToDo Liste hinzugefügt | * ToDo Liste hinzugefügt | ||
== To Do == | == To Do == | ||
== Notations == | |||
[[Asymptotic notation]] | [[Asymptotic notation]] | ||
=== String Matching Algorithms === | === String Matching Algorithms === | ||
* Simple string matching algorithm | |||
* String matching based on finite automaton | |||
=== Sorting Algorithms === | === Sorting Algorithms === | ||
* [[Insertion Sort]] | * [[Insertion Sort]] | ||
| Line 18: | Line 21: | ||
* [[B-Tree Merge]] | * [[B-Tree Merge]] | ||
* [[B-Tree Split]] | * [[B-Tree Split]] | ||
=== Graph Algorithms === | === Graph Algorithms === | ||
* [[Dijkstra]] | * [[Dijkstra]] | ||
| Line 37: | Line 39: | ||
* [[Graphs]] | * [[Graphs]] | ||
=== Other Algorithms === | === Other Algorithms === | ||
* [[ | * [[Cyclic Redundancy Check]] | ||
* [[Eulkid]] | * [[Eulkid]] | ||
* [[Gauss]] | * [[Gauss]] | ||
* [[Fast Fourier Transformation]] | * [[Fast Fourier Transformation]] | ||
* [[Bresenham]] | * [[Bresenham]] | ||
Revision as of 00:47, 10 September 2014
News
- [math]\displaystyle{ LaTeX }[/math] jetzt aktiv!
- ToDo Liste hinzugefügt
To Do
Notations
Asymptotic notation
String Matching Algorithms
- Simple string matching algorithm
- String matching based on finite automaton
Sorting Algorithms
Search Algorithms
- Binary Search