Talk:TPK algorithm

Domain errors

What amazes me is that not only the algorithm itself is sensitive to math domain errors, but that none of the implementations I've seen given seem to do anything about it. (For very large positive values one could solve f(t)==400, yielding for t around 4.3, and write 'TOO LARGE' before ever evaluating f(t).) bsod 18:44, 1 June 2006 (UTC)[reply]

Python example

The page says: ~~list instead of an array, (although there is an array module available)~~ The writer seems to assume the python list type is not an array. It's a resizable vector type (implemented as an array). The python array module is for storing masses of ints or floats without Object overhead.

Why not

for i in [int(raw_input()) for i in range(11)][::-1]

ALGOL source code

I reformatted the ALGOL code to make it more readable. In particular, it wasn't obvious where the f() procedure ends and the statements in the outer begin/end block begin. I'm not an Algol expert, so if I got any of it wrong, please feel free to correct it. — Loadmaster 17:51, 15 May 2007 (UTC)[reply]

Original Implementations for Direction

Would is be possible to post the original implementations by Trabb et al verbatim? Doing so would help clarify the intent of the authors. Is it to compare the syntax of various languages for demonstrational purposes? To achieve the goal in as little code as possible, golf-style? The original implementations might set better direction from the originators. Maerics 04:44, 27 June 2007 (UTC)[reply]