20 Mai
2005
20 Mai
'05
00:50
On May 19, 2005, at 10:47 PM, Bradley Lucier wrote:
There's a very nice little thread in comp.lang.lisp about how to calculate the number of partitions of a positive integer. The fastest algorithm by far uses Common Lisp's hash tables, so I thought I would try it with Gambit's tables, but it doesn't seem to work when compiled.
Sorry, it appears to be a gcc-4.0 bug, I had no problems using gcc-3.3 on MacOS 10.4.1.
I'll investigate it more
Brad