[Haskell-cafe] excercise - a completely lazy sorting algorithm
matthias.goergens at googlemail.com
Mon Jul 6 17:03:42 EDT 2009
> If someone can translate my algorithm into a non-side-effecting one,
> I'd appreciate it, but I think that like disjoint set/union, this is
> probably inherently side-effecting. Yes, yes, we could use functional
> arrays, but short of that I don't see a way to avoid side effects to
> take care of my amortized work.
I am just working on a side-effect-free version.
More information about the Haskell-Cafe