Long Multiplication ( Multiplication): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ auxiliary bits (Easily derived (needed for intermediate results)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1940 == Reference ==")
 
No edit summary
 
Line 5: Line 5:
== Space Complexity ==  
== Space Complexity ==  


$O(n)$ auxiliary bits
$O(n)$ bits


(Easily derived (needed for intermediate results))
(Easily derived (needed for intermediate results))

Latest revision as of 08:54, 10 April 2023

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$ bits

(Easily derived (needed for intermediate results))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1940

Reference