> (Data|State) Management and Processing
> Ordinal Data - Sorting problem Algorithm
Ordering is the process of finding the position of an element of ordinal data type in a sequence.
Order and Equivalence are a special kind of binary relation (ie relation between two entities)
Natural order can be found in ordinal data
With the order notion, you get immediately a sort and merge problem.
Comparison operator are at the heart of sort and merge problem problem.