Asymptotic Complexity Hidden Constants Hidden Contants 3000 2500 2000 100n+100 1500 n’nn+10 1000 500 0 0 5 10 15 Problem size Fa|2011 Advanced Compiler Techniques 77 Fall 2011 “Advanced Compiler Techniques” Asymptotic Complexity Hidden Constants Hidden Contants 0 500 1000 1500 2000 2500 3000 0 5 10 15 Problem Size Execution Time 100*n+100 n*n*n+10