![]() |
Finding smallest prime divider of NUM
im looking for a more efficient algorithm, is there any known one? ive checked my math books and c++ book and really didnt find anything more efficient than the following : <div class="codeblock"> <div class="spaced"> <div>C++ Syntax (
|
| All times are GMT -4. The time now is 05:25 PM. |
Powered by vBulletin®
Copyright ©2000 - 2026, Jelsoft Enterprises Ltd.