« Return to Thread: excercise - a completely lazy sorting algorithm

Re: excercise - a completely lazy sorting algorithm

by Matthias Görgens-2 :: Rate this Message:

Reply to Author | View in Thread

> 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.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@...
http://www.haskell.org/mailman/listinfo/haskell-cafe

 « Return to Thread: excercise - a completely lazy sorting algorithm