Weak Ordering

With <=:

• If a == b, then both are “before” each other:
• a <= b is true
• b <= a is true → this creates a cycle: “a comes before b” and “b comes before a”.

That cycle means there is no consistent ordering the algorithm can aim for.