running time

[Sin C. Ho]

I implemented a neighborhood search algorithm using C++ and STL. A
strange thing is that the first 1000 iterations use 0.01 min., but the
next 1000 iterations use 0.02 min. and the next 1000 iterations also use
0.02 min. Every iteration does exactly the same thing, and I don't
understand how come the first 1000 iterations use less time than the
rest. I hope you guys can help me out.

Sin

 

[Victor Bazarov]

I implemented a neighborhood search algorithm using C++ and STL. A
strange thing is that the first 1000 iterations use 0.01 min., but the
next 1000 iterations use 0.02 min. and the next 1000 iterations also use
0.02 min. Every iteration does exactly the same thing, and I don't
understand how come the first 1000 iterations use less time than the
rest. I hope you guys can help me out.

Increase the number of iterations to one million to get better resolution.

V

 

[Sin C. Ho]

Increase the number of iterations to one million to get better resolution.

V

Actually, I set the total number of iterations to 100,000. The first
1000 iterations require less time than the next 1000 iterations'.

Sin

 

[Victor Bazarov]

Actually, I set the total number of iterations to 100,000. The first
1000 iterations require less time than the next 1000 iterations'.

How sure are you about that? What's your way of timing your one thousand
iterations (whether first or next)? What if you time 900 or 1200, how
much different will the reading be?