Ready for some of the hard stuff? This section presents an algorithm for doing integer multiplication using shifts and adds. The algorithm is given in pseudo-code and then in CSC-1 assembler. A complete detailed example, showing every pass through the main loop, is given.