Jump to content

User:Phoe6/Books/Algorithms

From Wikipedia, the free encyclopedia


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