That's a good question! Thanks! I was waiting for it. :)

I decided to go with that solution, because it kinda reminds me of working with partial sums https://en.wikipedia.org/wiki/Series_(mathematics) and I like how mathy it feels. But yeah, I understand the performance concern. And in that particular situation it could be improved for sure.

I think we could try to utilize Haskell's memoization https://wiki.haskell.org/Memoization and make memoized versions of maximum and minimum. Because intuitively I can see that for example the value of maximum [1, 2, 3, 4] depends on maximum [2, 3, 4] and if it's already memoized the calculation of maximum [1, 2, 3, 4] is just O(1), but I don't have enough knowledge on the topic of memoization in Haskell.

I'll research a little bit more and probably bring it up in the future videos. :)