Used Haskell to return pair of values. As an elements it's only seen once by the algorithm costs are O n
- Group name: Jot
- Cost: O(n)
- Time expend: ~1s
- Sets size: 100 000
- To change the chase, change "chase" bind in hs.hs
- Timed with runghc, but compiling and executing should be a better way.
- Could be better if challange was made it parallel.