News:

Printed Amstrad Addict magazine announced, check it out here!

Main Menu
avatar_cpcitor

Multiplication/division time/space cost analysis ?

Started by cpcitor, 15:19, 16 January 13

Previous topic - Next topic

0 Members and 1 Guest are viewing this topic.

cpcitor

After Kevin's good introduction to multiplication, we can see

Programming:Integer Multiplication - CPCWiki , Programming:Ultrafast Multiplication - CPCWiki
and
Programming:Integer Division - CPCWiki

Prodatron's ultrafast solution is quite wild.
Executioner's solution seems clever, and it looks constant time which is really nice.

Anyone performed some time+size (esp. tables) analysis of the different solutions ?

Has anyone alternatives ?
Had a CPC since 1985, currently software dev professional, including embedded systems.

I made in 2013 the first CPC cross-dev environment that auto-installs C compiler and tools: cpc-dev-tool-chain: a portable toolchain for C/ASM development targetting CPC, later forked into CPCTelera.

fano

"NOP" is the perfect program : short , fast and (known) bug free

Follow Easter Egg products on Facebook !

ralferoo


fano

Quote from: ralferoo on 12:59, 17 January 13
What he said. Also, powers of 2... ;)
I forgot to add "as possible"  ;)
yep, i am trying to get power of 2 sizes structures too
"NOP" is the perfect program : short , fast and (known) bug free

Follow Easter Egg products on Facebook !

Powered by SMFPacks Menu Editor Mod