Given an implementation of the Hack computer detailed in the nand-to-tetris course, provides an in depth analysis of a simple swap then multiple algorithm in comparison to the naive implementation using repeated addition.
Go to file
Collin J. Doering 9bd7675dfe
Initial commit
Signed-off-by: Collin J. Doering <collin.doering@rekahsoft.ca>
2018-10-16 23:39:34 -04:00
code Initial commit 2018-10-16 23:39:34 -04:00
.gitignore Initial commit 2018-10-16 23:39:34 -04:00
Makefile Initial commit 2018-10-16 23:39:34 -04:00
mult-optimization-analysis.tex Initial commit 2018-10-16 23:39:34 -04:00
README.md Initial commit 2018-10-16 23:39:34 -04:00

Multiplication Algorithm Analysis on Hack

Given an implementation of the Hack computer detailed in the nand-to-tetris course, provides an in depth analysis of a simple swap then multiple algorithm in comparison to the naive implementation using repeated addition.