# Ordinal Data - Sorting problem Algorithm

> (Data|State) Management and Processing > Ordinal Data - Sorting problem Algorithm

### Table of Contents

## 1 - About

- Input: array of n numbers, unsorted.
- Output: array of n numbers, sorted (from smallest to largest)

Possible Assumption:

- numbers are distinct
- with duplicates, the problem can even be easier

Sorting has complexity O(n log n) but repeated sorting can be avoided with a better data structure

## 2 - Articles Related

Advertising