User:Phoe6/Books/Algorithms
From Wikipedia, the free encyclopedia
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:
- MediaWiki2LaTeX provides a softcopy PDF service. Uniquely, it remains under active support and may be used online or installed locally.
- Pedia Press offer final tidying and ordering of print-on-demand bound copies in (approximately) A5 format.
Please select an appropriate cover image for this book. See "Template:Saved book" for instructions."
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: ×ばつ 5.8 in, 210 ×ばつ 148 mm), with professional-quality layout and printing.">PediaPress
[ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ]
Algorithms
[edit ]From Wikipedia
[edit ]- Big O notation
- Computational complexity theory
- Analysis of algorithms
- Best, worst and average case
- Time complexity
- Divide and conquer algorithm
- Decision problem
- Approximation algorithm
- Boolean satisfiability problem
- Sorting algorithm
- Quicksort
- Merge sort
- Heapsort
- Insertion sort
- P (complexity)
- NP (complexity)
- P versus NP problem
- NP-hard
- NP-complete
- Graph (mathematics)
- Graph (data structure)
- Vertex (graph theory)
- Graph theory
- Planar graph
- Directed graph
- Complete graph
- Vertex cover
- Complete bipartite graph
- Tree (graph theory)
- Nearest neighbour algorithm
- Bellman–Ford algorithm
- Depth-first search
- Complexity class
- Breadth-first search
- Prim's algorithm
- Graph coloring
- Dijkstra's algorithm
- Kruskal's algorithm
- Glossary of graph theory
- Ford–Fulkerson algorithm
- Connectivity (graph theory)
- Path (graph theory)
- Matching (graph theory)
- Connected component (graph theory)
- Independent set (graph theory)
- Shortest path problem
- Minimum spanning tree
- Bipartite graph
- Spanning tree
- Travelling salesman problem
- String (computer science)
- Greedy algorithm
- Search algorithm
- Binary search algorithm
- Linear programming
- Dynamic programming
- Turing machine
- Non-deterministic Turing machine
- Algorithm
- Introduction to Algorithms