[racket] slow g^x=h mod p meet in the middle code

Can you send out someone's Python algorithm that runs so much faster? And can you compare them on the same machine because it really is apples vs oranges thus far. -- Matthias






On Feb 27, 2014, at 11:21 AM, "Cristian Baboi" <cristian.baboi at gmail.com> wrote:

> În data de Thu, 27 Feb 2014 18:07:58 +0200, Sam Tobin-Hochstadt <samth at cs.indiana.edu> a scris:
> 
>> On Thu, Feb 27, 2014 at 11:03 AM, Cristian Baboi
>> <cristian.baboi at gmail.com> wrote:
>>> În data de Thu, 27 Feb 2014 17:40:16 +0200, Matthias Felleisen
>>> <matthias at ccs.neu.edu> a scris:
>>> 
>>> 
>>>> 
>>>> $ racket yourprogram.rkt
>>>> cpu time: 21269 real time: 21571 gc time: 14551
>>>> 
>>>> The Rackety version.
>>> 
>>> 
>>> DrRacket on my computer
>>> cpu time: 218495 real time: 225567 gc time: 176686
>> 
>> 
>> You really shouldn't run benchmarks inside DrRacket:
>> http://docs.racket-lang.org/guide/performance.html?q=benchmarks#%28part._.Dr.Racket-perf%29
>> 
> 
> On command line windows7 x64 2.0 GHz dual core:
> cpu time: 132039 real time: 135030 gc time: 107431
> 
> I guess the computer is too old afterall...