Why infinite loops are faster than finite loops?
tastyminerals
tastyminerals at gmail.com
Sat Jun 20 21:11:57 UTC 2020
I am not sure that this is a question about D or a more general
one. I have watched this nice presentation "Speed Is Found In The
Minds of People" by Andrei:
https://www.youtube.com/watch?v=FJJTYQYB1JQ&feature=youtu.be?t=2596 and on 43:20 he says that "push_heap" is slow because of structured loops and finite for (throughout the presentation Andrei shows algorithm examples with infinite loops). I wonder why is that? Is it because the finite loop needs to keep track of the number of iterations it performs? Wouldn't the compiler optimize it better than the infinite one because it knows the number of iterations the for loop needs?
More information about the Digitalmars-d-learn
mailing list