I was wondering whether it was possible to predict the running time of a program based on its past performance.
My program works like this: A number n is input, and the output is one non-trivial factor of n.
Here are the running times for my program:
n Time (Seconds) 14532029 13 3030179473 15 196713135653087 16 10637324354877977711 16.5 39614081257145468489421554699 38 2596148429267540652519253520417593 48 1329227995784915988304043912021934473 159 170141183460469232859244535221380448391 236 1000000000000000000000000000000000000000000000019 8100 99999999999999999999999999999999999999999999999999 99991 27900
Is there a way to predict, for example, how long factoring a 100 digit number would take?
Thank You,
-Sam


LinkBack URL
About LinkBacks
