@[email protected] to [email protected]English • 3 months agoCompetitive Programming in Haskell: Union-Findbyorgey.github.iomessage-square4fedilinkarrow-up110arrow-down11
arrow-up19arrow-down1external-linkCompetitive Programming in Haskell: Union-Findbyorgey.github.io@[email protected] to [email protected]English • 3 months agomessage-square4fedilink
minus-square@[email protected]OPlinkfedilinkEnglish1•3 months agoAlso, I think the ‘find’ operation could be replaced by an operation that checks if two elements are in the same set. That way you don’t have to come up with a “name”.
Also, I think the ‘find’ operation could be replaced by an operation that checks if two elements are in the same set. That way you don’t have to come up with a “name”.