| Copyright | Copyright (C) 2021 Yoo Chung |
|---|---|
| License | GPL-3.0-or-later |
| Maintainer | dev@chungyc.org |
| Safe Haskell | Safe-Inferred |
| Language | GHC2021 |
Problems.P28
Description
Part of Ninety-Nine Haskell Problems. Some solutions are in Solutions.P28.
Documentation
lsort :: [[a]] -> [[a]] Source #
We suppose that a list contains elements that are lists themselves. Write a function to sort the elements of this list according to their length, i.e., short lists first and longer lists later.
Examples
>>>lsort ["xxx","xx","xxx","xx","xxxx","xx","x"]["x","xx","xx","xx","xxx","xxx","xxxx"]
lfsort :: [[a]] -> [[a]] Source #
Again, we suppose that a list contains elements that are lists themselves. But this time, write a function to sort the elements of this list according to their length frequency, i.e., lists with rare lengths are placed first, others with a more frequent length come later.
Examples
>>>lfsort ["xxx", "xx", "xxx", "xx", "xxxx", "xx"]["xxxx","xxx","xxx","xx","xx","xx"]