Skip to main content
edited body
Source Link
user16034
user16034

A likely explanation is the hidden constant. We can assume the following empirical formulas for the running times: c.n.log(n) and d.n.

Then it is possible that c.log(200000) >< d, for instance due to the parts of the code that are interpreted and those using precompiled functions.

A likely explanation is the hidden constant. We can assume the following empirical formulas for the running times: c.n.log(n) and d.n.

Then it is possible that c.log(200000) > d, for instance due to the parts of the code that are interpreted and those using precompiled functions.

A likely explanation is the hidden constant. We can assume the following empirical formulas for the running times: c.n.log(n) and d.n.

Then it is possible that c.log(200000) < d, for instance due to the parts of the code that are interpreted and those using precompiled functions.

Source Link
user16034
user16034

A likely explanation is the hidden constant. We can assume the following empirical formulas for the running times: c.n.log(n) and d.n.

Then it is possible that c.log(200000) > d, for instance due to the parts of the code that are interpreted and those using precompiled functions.