New in Wolfram Mathematica 7: Discrete Calculus ◄ previous | next ►
Analyze the Complexity of Algorithms
Find the complexity of the Schönhage-Strassen multiplication algorithm.
In[1]:=

Click for copyable input
RSolve[ y[n] == 2 y[4 Sqrt[n]] + Log2[n], y, n ]
Out[1]=



In[2]:=

Click for copyable input
RSolve[ y[n] == 2 y[4 Sqrt[n]] + Log2[n], y, n ];

DiscretePlot[Evaluate[y[n] /. First[%] /. C[1] -> 0], {n, 50, 500}, 

 AxesOrigin -> {0, 0}]
Out[2]=