Sorting Algorithms: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Data Structures and Algorithms =Overview=") |
|||
| Line 4: | Line 4: | ||
=Overview= | =Overview= | ||
The '''sorting problem''' if formally defined as follows: given a sequence of n numbers (a<sub>1</sub>, a<sub>2</sub>, ... a<sub>n</sub>) provided as input, the algorithm must produce as output a permutation (reordering) (a<sub>1</sub><sup>'</sup>, a<sub>2</sub>, ... a<sub>n</sub> | |||
Revision as of 01:50, 5 August 2018
Internal
Overview
The sorting problem if formally defined as follows: given a sequence of n numbers (a1, a2, ... an) provided as input, the algorithm must produce as output a permutation (reordering) (a1', a2, ... an