Need to partition a list into lists based on breaks in ascending order of elements (Haskell)
You can do this by resorting to manual recursion, but I like to believe Haskell is a more evolved language. Let’s see if we can develop a solution that uses existing recursion strategies. First some preliminaries. {-# LANGUAGE NoMonomorphismRestriction #-} — because who wants to write type signatures, amirite? import Data.List.Split — from package split … Read more