in reply to Re^9: Sorting, recursion, and tail-call optimizations
in thread Sorting, recursion, and tail-call optimizations

BrowserUk,
Yeah yeah, I am not quite right in the head. I am fine with it being dangerous or broken if it was consistent, but it doesn't make sense that one version would work and the other wouldn't. If you have any other ideas I would be most appreciative.

Cheers - L~R

  • Comment on Re^10: Sorting, recursion, and tail-call optimizations

Replies are listed 'Best First'.
Re^11: Sorting, recursion, and tail-call optimizations
by BrowserUk (Patriarch) on Jan 06, 2006 at 19:39 UTC

    As both my random guesses have missed by a mile, you'll have to wait for one of the real experts to come along.


    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.