Karatsuba Multiplication: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
Line 1: Line 1:
=Internal=
=Internal=
=Overview=
=Overview=
Apply the Gauss' trick and end up with three recursive calls instead of four. This yields a O(n*logn) complexity.
<font color=darkkhaki>TODO</font>
<font color=darkkhaki>TODO</font>
=Playground=
=Playground=
{{External|https://github.com/ovidiuf/playground/tree/master/learning/stanford-algorithms-specialization/01-karatsuba}}
{{External|https://github.com/ovidiuf/playground/tree/master/learning/stanford-algorithms-specialization/01-karatsuba}}


<center>&#91;[[Algorithms#q23wLp|Next]]]</center>
<center>&#91;[[Algorithms#q23wLp|Next]]]</center>

Revision as of 23:04, 18 September 2021

Internal

Overview

Apply the Gauss' trick and end up with three recursive calls instead of four. This yields a O(n*logn) complexity.


TODO

Playground

https://github.com/ovidiuf/playground/tree/master/learning/stanford-algorithms-specialization/01-karatsuba
[Next]