The Haskell class providing ordering operations, including
compare. A comparison-based sorting algorithm requires the associated constraint to inspect the order of arbitrary keys. Its correctness additionally assumes that the supplied operations obey the intended ordering laws. New to topics? Read the docs here!