Main Page: Difference between revisions

From Algowiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(5 intermediate revisions by 2 users not shown)
Line 1: Line 1:
== News ==
* The http://wiki.algo.informatik.tu-darmstadt.de domain will forward to this page from 13th October.
* The old wiki will be reachable at http://huffmann.algo.informatik.tu-darmstadt.de/wiki/
* <math>LaTeX</math> [http://www.mediawiki.org/wiki/Manual:Math available now!]
* ToDo List added
* Every content has to be in English!
* [http://www.mediawiki.org/wiki/Extension:SyntaxHighlight_GeSHi Syntaxhighlight]
== Rules ==
* Add finalized reconstructions of the old Wiki to Category:Checkup.
* Don't any non-Weihe content until the reconstructions isn't finished.
* Keep your active reconstructing Pages in "Division of labor" section up to date!
'''Look here for short/uncomplete Pages''' [[Special:ShortPages]]
== Page Status ==
Final: [[:Category:Checkup]]
== To Do ==
=== Notations ===
=== Notations ===
* [[Big O notation]]
* [[Big O notation]]
* [[L' Hospital]]
* [[L' Hospital]]
* [[Master theorem]]
* [[Master theorem]]
* [[Asymptotic comparison of functions]]


=== Problems ===
=== Problems ===
Line 103: Line 85:
* [[B-tree: remove]]
* [[B-tree: remove]]
* [[B-tree: shift key to sibling]]
* [[B-tree: shift key to sibling]]
* [[B-tree: rotate]]
* [[B-tree: merge]]
* [[B-tree: split]]
* [[B-tree: split]]
* [[Binary search tree: find]]
* [[Binary search tree: find]]
Line 168: Line 148:
=== Other ===
=== Other ===
* [[Model computer]]
* [[Model computer]]
=== Other Algorithms (LOCKED) ===
* [[B*]]
* [[Cyclic redundancy check]]
* [[Euclid]]
* [[Gauss]]
* [[Discrete fourier transform]]
* [[Fast fourier transform]]
* [[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 routing]]
* [[Z Buffer algorithm]]
* [[Marching squares]]
* [[Marching cubes]]
* [[Bottom-Up heapsort]]
* [[Radixsort]]
* [[Median cut]]
* [[Pancake sorting]]
* [[Karnaugh-Veitch diagramm]]
* [[Delanuay triangulation]]
* [[Backtracking]]
* [[Alpha–beta pruning]]
* [[Beam search]]
* [[Best-first search]]
* [[Bidirectional search]]
* [[Borůvka's algorithm]]
* [[Branch and bound]]
* [[D*]]
* [[Depth-limited search]]
* [[Edmonds' algorithm]]
* [[Fringe search]]
* [[Hill climbing]]
* [[IDA*]]
* [[Iterative deepening depth-first search]]
* [[Jump point search]]
* [[Lexicographic breadth-first search]]
* [[SMA*]]
* [[Uniform-cost search]]
=== Other Data Structures (LOCKED) ===
* [[Adelson-Velskii and Landis' tree]]
* [[Patricia-Trie]]
* [[Suffix Tree]]
* [[Huffmann Tree]]
* [[Binary Expression Tree]]
* [[Hash Set]]
* [[Incidence Matrix]]
* [[Voronoi Diagramm]]
* [[Quad Tree]]
* [[Oct Tree]]
* [[kd Tree]]
* [[Binary space partitioning]]

Latest revision as of 15:13, 30 November 2020

Notations

Problems

Coding Basics

String Matching Algorithms

Sorting Algorithms

Search Algorithms

Auxillary Algorithms

Manipulation

Tree Algorithms

Graph Theory

Graph Algorithms

Flow Algorithms

Abstract Data Structures

Implementations of Abstract Data Structures

???

Other

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Main_Page&oldid=3888"