Naive vs Complex solutions

著者 Doug Hull, August 1, 2012

1 ビュー (過去 30 日間) | 0 いいね | 0 コメント

This video is more philosophical than about MATLAB syntax. When trying to understand the cycles that occur in the output of a pseudo random number generator, I first approached the problem in easiest way I could think of. It worked well enough for small datasets, but because the computational order of complexity grew by N^2, this did not work very well. It took someone pointing out an algorithm that grew linearly with N to complete the job.

This kind of algorithmic innovation is needed in many cases because the profiler can help you on a line by line basis, but it can not find systematic problems like this.