Before designing an algorithm it is important to first understand what the problem is. Algorithms can be designed using pseudocode or a flowchart, and the standard notations of each should be known.

Researchers have devised an "absurdly fast" algorithm to solve the problem of finding the fastest flow through a network.

Let $S_k$ be the set of positive integers containing no arithmetic progression of $k$ terms, generated by the greedy algorithm. A heuristic formula, supported by computational evidence, is derived for ...