Mazdak Farrokhzad edited GraphExplained.tex  about 10 years ago

Commit id: 2f7f3ca53219f41a34a70e61aa164841b8499d41

deletions | additions      

       

the corresponding O(.) functions.  The oddities in the Algo-3 graph can be explained by the fact that  when a method has nott not  been run before, it has not been Just-In-Time compiled and thus it takes a few runs before it performs with optimal speed.  For the subsequent benchmarks the method seems to have been JIT compiled  and thus performs better than for n = 50.