Main Page: Difference between revisions
Jump to navigation
Jump to search
| Line 147: | Line 147: | ||
=== Other Algorithms (LOCKED) === | === Other Algorithms (LOCKED) === | ||
* [[B*]] | * [[B*]] | ||
* [[Cyclic | * [[Cyclic redundancy check]] | ||
* [[Eulcid]] | * [[Eulcid]] | ||
* [[Gauss]] | * [[Gauss]] | ||
* [[Discrete | * [[Discrete fourier transform]] | ||
* [[Fast | * [[Fast fourier transform]] | ||
* [[Bresenham]] | * [[Bresenham]] | ||
* [[Round | * [[Round robin]] | ||
* [[Seperate and | * [[Seperate and conquer]] | ||
* [[Message-Digest | * [[Message-Digest algorithm]] | ||
* [[Secure | * [[Secure hash algorithm]] | ||
* [[Sequent calculus]] | * [[Sequent calculus]] | ||
* [[Resolution calculus]] | * [[Resolution calculus]] | ||
* [[Cocke-Younger-Kasami | * [[Cocke-Younger-Kasami algorithm]] | ||
* [[Distance | * [[Distance vector routing]] | ||
* [[Link | * [[Link state routing]] | ||
* [[Z Buffer | * [[Z Buffer algorithm]] | ||
* [[Marching | * [[Marching squares]] | ||
* [[Marching | * [[Marching cubes]] | ||
* [[Bottom-Up | * [[Bottom-Up heapsort]] | ||
* [[Radixsort]] | * [[Radixsort]] | ||
* [[Median | * [[Median cut]] | ||
* [[Pancake sorting]] | * [[Pancake sorting]] | ||
* [[Karnaugh-Veitch | * [[Karnaugh-Veitch diagramm]] | ||
* [[Delanuay | * [[Delanuay triangulation]] | ||
* [[Backtracking]] | * [[Backtracking]] | ||
* [[Alpha–beta pruning]] | * [[Alpha–beta pruning]] | ||
Revision as of 08:49, 5 October 2014
News
- [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!
Divison of labor
- Fabio Cuozzo - Problems on Sequences
- Daniel Kratschmann - Problems
- Jan Hohmann - B-Tree
- Jan Rathjens - Ford-Fulkerson
- Thomas Lautenschläger - ???
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
String Matching Algorithms
Sorting Algorithms
Search Algorithms
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-Child
- 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
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 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