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.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Collin J. Doering 9bd7675dfe
Initial commit
1 year ago
code Initial commit 1 year ago
.gitignore Initial commit 1 year ago
Makefile Initial commit 1 year ago
README.md Initial commit 1 year ago
mult-optimization-analysis.tex Initial commit 1 year ago

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.