algorithm
A precise, finite list of steps that turns an input into the answer you want.
In more detail
Every function you write follows some algorithm, whether you named it or not. This course compares algorithms by how their work grows as the input grows, not by how fast one machine runs them. Choosing a better algorithm usually beats buying faster hardware once the input is large.
Related terms
- time complexity — A description of how the amount of work an algorithm does grows as its input gets bigger.
- data structure — A way of arranging data in memory, such as a list, dictionary, tree or graph, so that certain operations become cheap.
- Big O notation — A way of writing an upper bound on growth: O(f(n)) means the cost grows no faster than a constant times f(n) for large n.
Taught in
- Why Complexity Matters In Production — Algorithms & Data Structures for Working Engineers
- Recognising The Common Growth Rates — Algorithms & Data Structures for Working Engineers
- Space, In-Place Work And The Call Stack — Algorithms & Data Structures for Working Engineers
- Comparison Sorts: Insertion, Merge And Quicksort — Algorithms & Data Structures for Working Engineers
- Dijkstra: Shortest Paths With A Priority Queue — Algorithms & Data Structures for Working Engineers
- Minimum Spanning Trees: Kruskal And Prim — Algorithms & Data Structures for Working Engineers