Given two numbers as strings. The numbers may be very large (may not fit in long long int), the task is to find product of these two numbers.
Input : num1 = 4154 num2 = 51454 Output : 213739916 Input : num1 = 654154154151454545415415454 num2 = 63516561563156316545145146514654 Output : 41549622603955309777243716069997997007620439937711509062916
We start from last digit of second number multiply it with first number. Then we multiply second digit of second number with first number, and so on. We add all these multiplications. While adding, we put i-th multiplication shifted.
The approach used in below solution is to keep only one array for result. We traverse all digits first and second numbers in a loop and add the result at appropriate position.
The above code is adapted from the code provided by Gaurav.
Time Complexity : O(m*n), where m and n are length of two number that need to be multiplied.
Related Article :
Karatsuba algorithm for fast multiplication
This article is contributed by Aditya Kumar. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Modulo power for large numbers represented as strings
- Multiply large integers under large modulo
- Divide large number represented as string
- Square of large number represented as String
- Add two numbers represented by two arrays
- Russian Peasant (Multiply two numbers using bitwise operators)
- Add two numbers represented by linked lists | Set 2
- Add two numbers represented by linked lists | Set 1
- Subtract Two Numbers represented as Linked Lists
- Check if given number can be represented as sum of two great numbers
- Check if a number can be represented as a sum of 2 triangular numbers
- Count numbers which can be represented as sum of same parity primes
- Sum of two numbers where one number is represented as array of digits
- GCD of two numbers when one of them can be very large
- LCM of two large numbers
Improved By : DheerendraJaiswal