CPCWiki forum

General Category => Programming => Topic started by: cpcitor on 16:19, 16 January 13

Title: Multiplication/division time/space cost analysis ?
Post by: cpcitor on 16:19, 16 January 13
After Kevin's good introduction to multiplication (http://www.cpctech.org.uk/docs/mult.html), we can see

Programming:Integer Multiplication - CPCWiki (http://www.cpcwiki.eu/index.php/Programming:Integer_Multiplication) , Programming:Ultrafast Multiplication - CPCWiki (http://www.cpcwiki.eu/index.php/Programming:Ultrafast_Multiplication)
and
Programming:Integer Division - CPCWiki (http://www.cpcwiki.eu/index.php/Programming:Integer_Division)

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 ?
Title: Re: Multiplication/division time/space cost analysis ?
Post by: fano on 20:39, 16 January 13
Has anyone alternatives ?


I avoid them  ;D
Title: Re: Multiplication/division time/space cost analysis ?
Post by: ralferoo on 13:59, 17 January 13
I avoid them  ;D
What he said. Also, powers of 2... ;)
Title: Re: Multiplication/division time/space cost analysis ?
Post by: fano on 16:02, 18 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