[Haskell-cafe] Adding `reverse` and `sortBy` to `Traversable`

Folks[1] have known for a long time that `reverse` and `sortBy` can both be implemented in terms of `mapAccumL`. Would it make sense to add those to `Data.Traversable` as functions or methods? [1] For example, Will Fancher wrote about it in 2017. --- Sent from my phone with K-9 Mail.