Strict weak ordering

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Strict weak ordering is a binary relation on a set. Such relations define a strict ordering, but they contain several elements of the same type. An example might be the relation "costs less than", or "is cheaper than". For any two elements that are of different types, the relation holds. On the other hand, there are some elements that cannot be ordered that way, because they are of the same type. An example for such a relation may be the relation, costs less than: milk may cost less than bread, and bread may cost less than cake. Two items of different types may cost less than another, but they can otherwise have the same price.

Two different algorithms that sort words by the number of letters in the word may not give the same ordering of the words with the same number of letters, but they will always give an ordering where the four-letter words come before the five-letter-words, and after the three-letter-words.

Time will give a strict weak ordering too; Events that are equivalent in the timeframe happen at the same time.