I tested some cases in C # to consider some essential aspects of performance. While I tested, I came across a strange case
for (int i = 0; i < 30; i++) { DateTime d = DateTime.Now; print(); result.Add ((DateTime.Now - d)); } foreach(TimeSpan t in result) Console.WriteLine(t.ToString());
while the print function was simple:
public static void print () { for (int i = 0; i < 10000; i++) { Console.WriteLine( string.Format("{0}", i)); } }
i was shocked by the results, while the first three loops took about 5 seconds, and after that it took about 0.5 seconds. Here is some of them:
00:00:05.6212696 00:00:05.6072002 00:00:05.5837965 00:00:01.9451673 00:00:00.5526335 00:00:00.5540554 00:00:00.5676418 00:00:00.5372442 00:00:00.5772550
I just want to know why it got better almost 10 times after the third iteration?
source share