maximum problem size (ntime (ms second minute hour , , , , , , the importance of good algorithm design goes beyond just what can be solved effectively on given computerhowever as shown in table even if we achieve dramatic speed-up in hardwarewe still cannot overcome the handicap of an asymptotically slow algorithm this table shows the new maximum problem size achievable for any fixed amount of timeassuming algorithms with the given running times are now run on computer times faster than the previous one table increase in the maximum size of problem that can be solved in fixed amount of timeby using computer that is times faster than the previous one