 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
- Vertex cover
- Monte Carlo method
- König's theorem (graph theory)
- Menger's theorem
- Miller–Rabin primality test
- Regular graph
- Knapsack problem
- Travelling salesman problem
- Stable marriage problem
- Correctness (computer science)
- Big O notation
- Time complexity
- Best, worst and average case
- Sorting algorithm
- Merge sort
- Quicksort
- Independent set (graph theory)
- Divide and conquer algorithm
- Closest pair of points problem
- Multiplication algorithm
- Matrix multiplication
- Master theorem
- Analysis of algorithms
- Glossary of graph theory
- Connected component (graph theory)
- Bipartite graph
- Parity (mathematics)
- Directed acyclic graph
- Topological sorting
- Interval scheduling
- Depth-first search
- Breadth-first search
- Dijkstra's algorithm
- Greedy algorithm
- Dynamic programming
- Optimal substructure
- Memoization
- Bellman–Ford algorithm
- Minimum cut
- Maximum flow problem
- Ford–Fulkerson algorithm
- Edge disjoint shortest pair algorithm
- Max-flow min-cut theorem
- Matching (graph theory)
- Segmentation (image processing)
- Circulation problem
- Kruskal's algorithm
- Disjoint sets
- Minimum spanning tree
- Prim's algorithm
- Priority queue
- Disjoint-set data structure
- Linked list
- Primality test
- Hash function
- Randomized algorithm