A recent post benchmarked the actual running time (not number of instructions) for a number of algorithms and found that the lack of accounting for the effects of caching made the graphs lie. It seems most accurate to multiply your algorithm's classic running time by the square root of N.
How sobering.
http://www.ilikebigbits.com/blog/2014/4/21/the-myth-of-ram-part-i
No comments:
Post a Comment