|
|
| Line 1: |
Line 1: |
| == News ==
| | <strong>MediaWiki has been successfully installed.</strong> |
| * <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]
| |
|
| |
|
| == To Do ==
| | Consult the [//meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software. |
| === Notations ===
| |
| * [[Asymptotic notation]]
| |
| * [[L' Hospital]]
| |
| * [[Master theorem]]
| |
| === Problems ===
| |
| * [[Maximum matching problem]]
| |
| * [[Max-Flow Problems]]
| |
| * [[Min-Cost Flow Problems]]
| |
| * [[Shortest Paths Problems]]
| |
| ** [[All pairs shortest paths]]
| |
| *** [[Floyd-Warshall]]
| |
| *** [[Bellman-Ford]]
| |
| *** [[Shortest paths by repeated squaring]] (variant of Bellman-Ford)
| |
| ** [[Single source shortest paths]]
| |
| *** [[Dijkstra]]
| |
| ** [[Single source single target shortest paths]]
| |
| *** [[A*]]
| |
| * [[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 === | | == Getting started == |
| * [[Heritage]]
| | * [//www.mediawiki.org/wiki/Manual:Configuration_settings Configuration settings list] |
| * [[Generics]]
| | * [//www.mediawiki.org/wiki/Manual:FAQ MediaWiki FAQ] |
| * [[Collections]]
| | * [https://lists.wikimedia.org/mailman/listinfo/mediawiki-announce MediaWiki release mailing list] |
| ** [[Iterator]]
| | * [//www.mediawiki.org/wiki/Localisation#Translation_resources Localise MediaWiki for your language] |
| ** [[Comparator]]
| |
| | |
| === String Matching Algorithms ===
| |
| * [[Simple string matching algorithm]]
| |
| * [[String matching based on finite automaton]]
| |
| | |
| === Sorting Algorithms ===
| |
| * [[Bubble]]
| |
| * [[Insertion Sort]]
| |
| * [[Quick Sort]]
| |
| * [[Bubble Sort]]
| |
| * [[Merge Sort]]
| |
| * [[Bucket Sort]]
| |
| * [[Selection Sort]]
| |
| * [[Bogo Sort]]
| |
| | |
| === Search Algorithms ===
| |
| * [[Binary Search]]
| |
| | |
| === 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:Rotate]]
| |
| * [[B-Tree:Merge]]
| |
| * [[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:Traverse]]
| |
| | |
| === Graph Theory ===
| |
| * [[Directed Graph]]
| |
| * [[Bipartite Graph]]
| |
| * [[Negative Paths]]
| |
| | |
| === Graph Algorithms ===
| |
| * [[Dijkstra]]
| |
| * [[Kruskal]]
| |
| * [[Prim]]
| |
| * [[Bellman-Ford]]
| |
| * [[Floyd Warshall]]
| |
| * [[Union Find]]
| |
| * [[A*]]
| |
| * [[Alternating paths algorithm]]
| |
| * [[Johnson]]
| |
| | |
| === Flow Algorithms ===
| |
| * [[Ford-Fulkerson]]
| |
| === 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) ===
| |
| * [[B*]]
| |
| * [[Cyclic Redundancy Check]]
| |
| * [[Eulcid]]
| |
| * [[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 Round]]
| |
| * [[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]]
| |