Revision as of 23:39, 23 July 2023 edit 2001:2020:32b:bfa2:9cda:8d0a:5ed:556b (talk) →Schönhage–Strassen ← Previous edit		Revision as of 23:04, 24 July 2023 edit undo Dogantoro (talk \| contribs) 5 edits m typo - spelling mistake fixed Tag: Visual edit Next edit →
Line 294: {{Main\|Karatsuba algorithm}} Karatsuba multiplication is an O(''n''<sup>log<sub>2</sub>3</sup>) ≈ O(''n''<sup>1.585</sup>) divide and ~~conquare~~conquer algorithm, that uses recursion to merge together sub calculations. By rewriting the formula, one makes it possible to do sub calculations / recursion. By doing recursion, one can solve this in a fast manner.

Multiplication algorithm: Difference between revisions