Finite Ordered Set
(Redirected from ranked list)
Jump to navigation
Jump to search
A Finite Ordered Set is an ordered set that is a finite list.
- AKA: Ranking Set.
- Context:
- It is composed of Zero or more Ordinal Values.
- It can be represented by a Finite Ordered Set Data Structure.
- …
- Example(s):
- a TOP500 List.
- a String.
- …
- Counter-Example(s):
- an Unordered Set.
- an Ordered Multiset.
- a Non-Finite Ordered Set.
- See: Finite Partially Ordered Set, Ordered, Enumerated List.