➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author mark.dickinson
Recipients belopolsky, draghuram, mark.dickinson, rhettinger, stutzbach
Date 2010-05-13.21:28:06
SpamBayes Score 0.047421645
Marked as misclassified No
Message-id <1273786088.25.0.951000165501.issue8692@psf.upfronthosting.co.za>
In-reply-to
Content 
Does anyone feel like doing a speed comparison between Daniel's C patch and a version with a direct no-frills iterative version of factorial_part_product (i.e., just a simple  'for (i = n; i <= m; i += 2) { <multiply running product by i> }?  I have a sneaking suspicion that the iterative version will be faster even for quite large values of n, but I'd be happy to be proven wrong.
History
Date User Action Args
2010-05-13 21:28:08mark.dickinsonsetrecipients: + mark.dickinson, rhettinger, belopolsky, draghuram, stutzbach
2010-05-13 21:28:08mark.dickinsonsetmessageid: <1273786088.25.0.951000165501.issue8692@psf.upfronthosting.co.za>
2010-05-13 21:28:07mark.dickinsonlinkissue8692 messages
2010-05-13 21:28:06mark.dickinsoncreate