Too Long; Didn't Read
In the <a href="https://mmhaskell.com/blog/2017/6/19/profiling-in-haskell" target="_blank">last two articles</a> we dealt with some algorithmic issues. We were only able to solve these by improving the data structures in our code. First we used Haskell’s built in array type for fast indexing. Then when we needed a segment tree, and we decided to make it from scratch. But we can’t roll our own data structure for every problem we encounter. So it’s good to have some systems we can use for more of these advanced topics.