Main Page: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 19: | Line 19: | ||
== To Do == | == To Do == | ||
=== Notations === | === Notations === | ||
* [[ | * [[Big O notation]] | ||
* [[L' Hospital]] | * [[L' Hospital]] | ||
* [[Master theorem]] | * [[Master theorem]] | ||
=== Problems === | === Problems === | ||
* [[Maximum matching problem]] | * [[Maximum matching problem]] | ||
Revision as of 16:05, 18 October 2014
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]\displaystyle{ LaTeX }[/math] available now!
- ToDo List added
- Every content has to be in English!
- 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
Problems
- Maximum matching problem
- Max-Flow Problems
- Min-Cost Flow Problems
- Shortest Paths Problems
- Maximum spanning forest
- Problems on Sequences
- Basic Problems on Sequences
- Find an element in a sequence (DONE)
- Insert an element in a sequence (Empty in old wiki?!)
- Median (DONE)
- Merging two sorted sequences (DONE)
- Pattern Matching
- One-dimensional string matching (DONE)
- String matching (DONE)
- Sorting
- Basic Problems on Sequences
Coding Basics
- Heritage (should be named inheritance??)
- Generics
- Collections
String Matching Algorithms
Sorting Algorithms
Search Algorithms
Auxillary Algorithms
Manipulation
- Array list: find
- Array list: find at position
- Array list: insert at head
- Array list: insert at position
- Array list: number
- Array list: remove
- Doubly-linked list: insert at position
- Doubly-linked list: insert at tail
- Doubly-linked list: remove
- Find element in sequence iteratively
- Find element in sequence recursively
- Hashtable: find
- Hashtable: insert
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: remove node
- Binary search tree: traverse
Graph Theory
Graph Algorithms
- Dijkstra
- Kruskal
- Prim
- Bellman-Ford (DONE)
- Floyd-Warshall
- Union Find
- A*
- Alternating paths algorithm
- Johnson
- Union-find with disjoint trees: find
- Union-find with lists: unite
- Max-flow min-cut
Flow Algorithms
Abstract Data Structures
Implementations of Abstract Data Structures
- Linked list
- Array list
- Binary search tree
- Doubly-linked list
- Heap as array (DONE (Heap as Array))
- Hashtable
- Multi-way search tree
- Red-black tree
- B-tree
???
Other
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 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