Algorithms

The named, well-defined procedures for solving a specific computational problem, carried as their own subject distinct from the broader ideas they draw on: sorting and searching algorithms such as Quicksort and binary search, graph algorithms such as Dijkstra's algorithm and A*, and other named procedures such as RSA encryption and the fast Fourier transform, each carried with the problem it solves, its time and space complexity, and the person or people credited with it. Belongs here: a named, specific algorithm with a defined step-by-step procedure, such as Quicksort, Dijkstra's algorithm, RSA or the fast Fourier transform. Does not belong here: the broader theoretical idea, paradigm or data structure an algorithm is built on, such as recursion or the linked list, which remains Concepts' subject, the language an algorithm happens to be implemented in, which is Programming Languages' subject, or a full running system, which is Systems' subject.