How can I multiply and divide using only bit shifting and adding?

Question

How can I multiply and divide using only bit shifting and adding?

Answer 1

1. A left shift by 1 position is analogous to multiplying by 2. A right shift is analogous to dividing by 2.
2. You can add in a loop to multiply. By picking the loop variable and the addition variable correctly, you can bound performance. Once you've explored that, you should use Peasant Multiplication