top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

Multiply two long integers of n digits using divide and conquer method?

0 votes
264 views

You are given 2 long integers having n digits each and you are required to multiply them using C.

Assumptions
Numbers are represented in an array of size n .
Calculate the time complexity using traditional divide and conquer

posted Oct 10, 2017 by anonymous

Looking for an answer?  Promote on:
Facebook Share Button Twitter Share Button LinkedIn Share Button

Similar Questions
+2 votes

Provide an algorithm to add and multiply two large integers which cannot be represented by built-in types, C code would be a great help?

+5 votes

Given an integer N, traverse it's digits {d1,d2,d3,d4.....dn} and find out how many of them evenly dived the number N?
for example:1012 ,digits 1, 1 and 2 evenly divide 1012 while 0 does not
so the output is =3

+2 votes

Count how many integers from 1 to N contains 0's as a digit? Please share the sample c program?

+4 votes

Say I have given two big numbers i.e. 10^8 and 10^9 what could be the best way to multiply them without facing the overflow issue.

...