Re: recursion depth
Re: recursion depth
- Subject: Re: recursion depth
- From: "Nigel Garvey" <email@hidden>
- Date: Mon, 10 Oct 2005 12:56:27 +0100
has wrote on Sun, 9 Oct 2005 22:18:54 +0100:
>FWIW, the only situation I can think of offhand where call stack overflows
>are a significant problem for ASers are in recursive sort routines such as
>quicksort. And you can avoid those by using non-recursive algorithms instead
Or an intelligent mixture. Recursive algorithms seldom need to go very
deep -- as I believe you're saying. There's often a lot of to-ing and fro-
ing between the different levels, but the maximum depth is usually not
very much. Even on a Jaguar machine -- which allows 248 levels by Matt's
script -- the quicksort that Arthur Knapp and I wrote a couple of years
ago can sort a million items without running into trouble.
NG
_______________________________________________
Do not post admin requests to the list. They will be ignored.
Applescript-users mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
This email sent to email@hidden