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

This would be highly anomalous. Python is usually at least 10 times slower
than Racket for most tasks.


On Thu, Feb 27, 2014 at 10:49 AM, Cristian Baboi
<cristian.baboi at gmail.com>wrote:

> În data de Thu, 27 Feb 2014 17:41:06 +0200, Neil Toronto <
> neil.toronto at gmail.com> a scris:
>
>
>  On 02/27/2014 08:33 AM, Cristian Baboi wrote:
>>
>>> În data de Thu, 27 Feb 2014 17:04:51 +0200, Neil Toronto
>>> <neil.toronto at gmail.com> a scris:
>>>
>>>  On 02/27/2014 07:55 AM, Jens Axel Søgaard wrote:
>>>>
>>>>> 2014-02-27 15:23 GMT+01:00 Cristian Baboi <cristian.baboi at gmail.com>:
>>>>>
>>>>>> Hello,
>>>>>>
>>>>>
>
>>  Your changes give the same running time as my version: ~ 3 min on my
>>> computer in DrRacket.
>>>
>>
>> How fast are your beatnik friends' implementations?
>>
>>
> A few seconds on Intel i5  or core2duo in python or java ...
>
>
> ____________________
>  Racket Users list:
>  http://lists.racket-lang.org/users
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20140227/33fe0944/attachment.html>