on complexity [Was: on goto]
in [General Programming]
|
Prev: on complexity [Was: on goto]
Next: on complexity
From: Phil Carmody on 14 May 2010 03:20 Richard Heathfield <rjh(a)see.sig.invalid> writes: > Nick Keighley wrote: > <snip> >> Your code compiles and runs and gives the same answers for both >> functions. >> >> But it still says they both have a complexity of 5 >> Ah, but the graphs look much more similar. Near identical. >> Pictures on their way > > And now they're on the Web. Please note that, as the URL suggests... > > <http://www.cpax.org.uk/scratch/seseseme.php> Hmmm, have you dammed your server? Phil -- I find the easiest thing to do is to k/f myself and just troll away -- David Melville on r.a.s.f1
From: Richard Heathfield on 14 May 2010 06:24
In <87mxw3eyp8.fsf(a)kilospaz.fatphil.org>, Phil Carmody wrote: > Richard Heathfield <rjh(a)see.sig.invalid> writes: >> Nick Keighley wrote: >> <snip> >>> Your code compiles and runs and gives the same answers for both >>> functions. >>> >>> But it still says they both have a complexity of 5 >>> Ah, but the graphs look much more similar. Near identical. >>> Pictures on their way >> >> And now they're on the Web. Please note that, as the URL >> suggests... >> >> <http://www.cpax.org.uk/scratch/seseseme.php> > > Hmmm, have you dammed your server? BT dammed it yesterday, so I undammed it. They dammed it again today. I just undammed it again. Give it an hour or so... -- Richard Heathfield <http://www.cpax.org.uk> Email: -http://www. +rjh@ "Usenet is a strange place" - dmr 29 July 1999 Sig line vacant - apply within |