Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.lang.asm.x86    |    Ahh, the lost art of x86 assembly    |    4,675 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 3,474 of 4,675    |
|    Alex McDonald to fizz buzz    |
|    Re: Fast Fizz Buzz program    |
|    19 Jul 18 14:15:01    |
      From: alex@nospicedham.rivadpm.com              On 19-Jul-18 13:52, fizz buzz wrote:       > On Thursday, July 19, 2018 at 7:41:09 AM UTC-5, Rosario19 wrote:       >> On Sun, 15 Jul 2018 21:41:09 -0700 (PDT), fizz buzz wrote:       >>       >>> Hello.       >>>       >>> Me and my friend are trying to create fastest Fizz Buzz program.       >>       >> as someone said for me the fastes solution it is:       >>       >> write manually the output that it is       >> and than put it in a data label       >> and than print it       >> the only instruction is print one array of chars       >       > According to this logic, fastest prime number calculating algorithm would       > just print text file with already calculated prime numbers.       >       > No cheating, guys! :-)       >              It's called memoization, and it's a great technique that trades time for       space. https://en.wikipedia.org/wiki/Memoization.              Lookup tables for expensive-to-calculate functions have been used by       human computers since Jesus was a boy. Perhaps the ultimate memoization       tools prior to our obsession for calculating this stuff from raw with       algorithms, was the slide rule, or the astrolabe -- or just even the       fairly thick books of trig tables with sin, cos and tan to 5 decimal       places that I remember as a boy using in my maths classes.              --       Alex              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca