2 Feb
2016
2 Feb
'16
6:13 p.m.
On Feb 2, 2016, at 7:53 PM, Tom Rokicki <rokicki@gmail.com> wrote:
Is the MMA algorithm a faithful implementation of Conway and Sloane's algorithm?
The MMA algorithm is O(n log n) due to Ordering[], but there's a well-known linear-time algorithm; certainly Conway and Sloane's algorithm is linear-time?
-tom
from C&S: "The only substantial amount of computation needed is for the sort in Step 3, which takes O(n log n) steps" My Mma code is doing pretty much exactly what I subsequently saw in your beautifully terse description: "round, determine total error (say, +e), "e" values to round the other way selecting those with the least individual error”. How do you identify the “e” elements with least individual error without doing a sort? -Veit