01 개요
분류 알고리즘과 관련된 정렬 방식의 분류로 아래와 같은 분류가 존재하는 것으로 보인다.
{Reflexible | Strict} {Weak | Strong} Ordering
최종 수정일 : 2023.01.20
02 Properties
Irreflexivity
: f(x, x) must be false.
Antisymmetry
: f(x, y) implies !f(y, x)
Transitivity
: f(x, y) and f(y, z) imply f(x, z).
Transitivity of equivalence
: Equivalence (as defined above) is transitive: if x is equivalent to y and y is equivalent to z, then x is equivalent to z. (This implies that equivalence does in fact satisfy the mathematical definition of an equivalence relation.)
Philip Sung