https://github.com/ndsvw/karatsuba-binary-multiplying-python
Divide and Conquer algorithm to multiply n-bit numbers in O(n^1.58).. This implementation works completely without using Python's "*"-operator; just "+", "-", bitwise operations and a lookup table.
https://github.com/ndsvw/karatsuba-binary-multiplying-python
algorithm algorithms divide-and-conquer karatsuba karatsuba-algorithm karatsuba-multiplication multiply
Last synced: 4 months ago
JSON representation
Divide and Conquer algorithm to multiply n-bit numbers in O(n^1.58).. This implementation works completely without using Python's "*"-operator; just "+", "-", bitwise operations and a lookup table.
- Host: GitHub
- URL: https://github.com/ndsvw/karatsuba-binary-multiplying-python
- Owner: ndsvw
- License: mit
- Created: 2019-06-17T14:53:57.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2019-06-19T07:47:11.000Z (about 6 years ago)
- Last Synced: 2025-01-14T02:26:09.434Z (5 months ago)
- Topics: algorithm, algorithms, divide-and-conquer, karatsuba, karatsuba-algorithm, karatsuba-multiplication, multiply
- Language: Python
- Homepage:
- Size: 1.95 KB
- Stars: 4
- Watchers: 2
- Forks: 0
- Open Issues: 0