2017-07-03 18:40 GMT+02:00 George Neuner :
> On Sat, 1 Jul 2017 17:14:01 +0200, Jens Axel Søgaard
> wrote:
>
> >Hi Billy
> >
> >Just curious. How long does the simple solution take:
> >
> >#lang racket/base
> >(require math/number-theory)
> >
> >(define (f n)
> > (for/sum ([x (in-range 1 (+ n 1)
>From my experience, being with a factor or 2 or 3 on such code is pretty good.
>Just wait a decade :-)
> On Jul 2, 2017, at 3:19 PM, 'Shakin Billy' via Racket Users
> wrote:
>
> @ matthias
> i'm aware that java got more manpower, but since this is the first time i
> compare racket and jav
Hi Billy
Just curious. How long does the simple solution take:
#lang racket/base
(require math/number-theory)
(define (f n)
(for/sum ([x (in-range 1 (+ n 1))]
#:when (= (length (divisors x)) 8))
1))
(f 10e6)
/Jens Axel
--
You received this message because you are sub
> On Jul 1, 2017, at 10:05 AM, 'Shakin Billy' via Racket Users
> wrote:
>
> i still don' wanna believe java is faster/better!
I don’t know which version of Java you’re running but in all likelihood, you
are competing with a system on which some company spent 2 orders of magnitude
more money
4 matches
Mail list logo