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.
|
||
---|---|---|
code | ||
.gitignore | ||
Makefile | ||
mult-optimization-analysis.tex | ||
README.md |
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.