User:Sudoström/Books/Big-O Algorithm Complexities

ABC: Always Be Coding I

 * Searching
 * Depth-first search
 * Breadth-first search
 * Binary search algorithm
 * Brute-force search
 * Dijkstra's algorithm
 * Bellman–Ford algorithm


 * Sorting
 * Quicksort
 * Merge sort
 * Heapsort
 * Bubble sort
 * Insertion sort
 * Selection sort
 * Bucket sort
 * Radix sort


 * Data Structures
 * Array data structure
 * Dynamic array
 * Doubly linked list
 * Skip list
 * Hash table
 * Binary search tree
 * Cartesian tree
 * B-tree
 * Red–black tree
 * Splay tree
 * AVL tree


 * Heaps
 * Linked list
 * Binary heap
 * Binomial heap
 * Fibonacci heap


 * Graphs
 * Adjacency list
 * Adjacency matrix
 * Incidence matrix