You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
This code appends the user's text file and writes two separate files (squared and cubed) from it. The first file will contain all numbers from the user's file multiplied to two while the second file contains the user's file multiplied to three.