Content deleted Content added
collapsed the sections containing original research not related to the article |
Reassessing as C-class quality |
||
Line 1:
{{maths rating |class=C |importance=low |field=applied}}
== Divide and conquer (February 2011) ==
Line 22 ⟶ 18:
I think this is wrong. According to [[Merge_sort]], von Neumann invented Merge Sort in 1945. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/84.74.154.5|84.74.154.5]] ([[User talk:84.74.154.5|talk]]) 14:11, 23 July 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
I think, this is an absurd to compare von Neumann Merge Sort and the Karatsuba fast multiplication algorithm. Only after the Karatsuba algorithm the history of fast algorithms began. Such fast processes like AGM method of Gauss, Newton method etc. become FAST only with application of fast multiplication. Von Neumann or anybody else results can not help here. That is why the Karatsuba algorithm can be considered as the frist FAST algorithm in the history of computations. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/83.149.209.253|83.149.209.253]] ([[User talk:83.149.209.253|talk]]) 14:37, 31 March 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
| |||