Created
April 21, 2014 16:41
-
-
Save zapstar/11148239 to your computer and use it in GitHub Desktop.
A method for multiplying faster than our repeated addition
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Really cool algorithm I learnt from a blog somewhere | |
| # Also sometimes called russian's peasents algorithm | |
| def fast_multiply(a,b): | |
| z=0; | |
| while a > 0: | |
| if a % 2 == 1: | |
| z = z + b | |
| a = a >> 1 | |
| b = b << 1 | |
| return z | |
| print fast_multiply(14,11) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment