Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
Over the years computer scientists have identified a number of general techniques that often yield effective algorithms to solve large classes of problems. This paper presents divide and conquer algorithm based problem for the multiplication of long integers. In this paper, we have introduced a new technique to calculate the complexity for the multiplication of long integers.
How to cite this article:
M.Sadiq . Complexity Analysis of Multiplication of Long Integers.
DOI: https://doi.org/10.36478/ajit.2006.111.112
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2006.111.112