Orchid XP v8 <voi### [at] devnull> wrote:
> Mmm, I see. Yes, the third identity requires you to either recurse twice 
> (requiring more stack), or to build a table of results to avoid the 
> extra recursion (also requiring more memory).

  More concrete examples: Heap sort can be implemented iteratively (the
heap sort algorithm itself only requires O(1) memory to sort an array
of values). AFAIK, quicksort cannot be implemented iteratively.

-- 
                                                          - Warp

Post a reply to this message