# Ordinal Data - Order type

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

### Table of Contents

## 1 - About

In mathematics, especially in set theory, two ordered sets X,Y are said to have the same order type just when they are order isomorphic, that is, when there exists a bijection f: X → Y such that both f and its inverse are monotone (order preserving).

For example:

- the set of integers and the set of even integers have the same order type, because the mapping n → 2n preserves the order.
- But the set of integers and the set of rational numbers (with the standard ordering) are not order isomorphic, because, even though the sets are of the same size (they are both countably infinite), there is no order-preserving bijective mapping between them.