Skip to main content

7 docs tagged with "algorithm"

View all tags

Complexity Analysis

How much work an algorithm does as its input grows, and how that estimate picks the implementation before you measure.

Graph Algorithms

Shortest paths and minimum spanning trees: which algorithm fits which graph, and where the complexity moves.

Graph Structures

Adjacency matrices, adjacency lists, topological sort and union-find: how a graph is stored decides which algorithm is cheap.

Linear Structures

Arrays, linked lists, stacks, queues and hash tables: the storage trade-offs behind every collection API.

Sorting & Searching

Quicksort, merge sort and binary search: the comparison model, stability, and when the input shape changes the right answer.

Trees & Heaps

Binary trees, red-black trees, B-trees, B+ trees and heaps: the balance and fan-out choices behind ordered data.