sortBy sorts the specified Seq according
to the specified comparator. The sort is stable. If stability is not
required, unstableSortBy can be slightly faster.
A generalization of unstableSort,
unstableSortBy takes an arbitrary comparator and sorts the
specified sequence. The sort is not stable. This algorithm is
frequently faster and uses less memory than sortBy.