Anonymous user
Talk:Hamming numbers: Difference between revisions
→Changes to the Java algorithm
Line 66:
Looking at the algorithm, the "multiply by two" buffer never grows -- it always contains exactly one element. So it can be eliminated. The "multiply by three" buffer never receives more than half the limit numbers, which is what I use as buffer size. Since this buffer only grows with powers of two, we could use a circular buffer sized after log2(limit) but that would complicate the code.
I don't know if the above comments were in reference to the previous version, but the version on the page would NPE when I ran it with a parameter of 20. I replaced it with a new version. I think what I came up with is kinda like a lazy merge. --[[User:Paul.miner|Paul.miner]] 22:46, 29 December 2010 (UTC)
| |||