Sorts similar to sort/2, but determines the order of two terms
by calling Compare(-Delta, +E1, +E2). This call must unify Delta
with one of <, > or =. If built-in predicate compare/3 is used,
the result is the same as sort/2 (but sort/2 is built using more
low-level primitives and is considerably faster).
- keysort/2 provides an more portable way to sort on
arbitrary keys that is usually faster.
Tag confusing pages with doc-needs-help|Tags are associated to your profile if you are logged in