Sorting Algorithms

Internal

• Data Structures and Algorithms

Overview

The sorting problem if formally defined as follows: given a sequence of n numbers (a₁, a₂, ... a_n) provided as input, the algorithm must produce as output a permutation (reordering) (a^'₁, a^'₂, ... a^'_n) of the input sequence such that a^'₁ ≤ a^'₂ ≤ ... ≤ a^'_n.