"Slime" <slm### [at] slimelandcom> wrote in message news:3eb2b0ec$1@news.povray.org...
> You could probably replace the loops with some sort of recursion to give
> this an O(log(n)) running time by doing binary search.
>
>  - Slime
> [ http://www.slimeland.com/ ]
>
Do you mean that it's possible to do recursion with functions?
I've never thought about that. That's interesting.
You can then use only a couple of functions with a select in it.
I must try that!

Jaap Frank

Post a reply to this message