Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I was testing some sorting algorithms and measuring their execution time and found something quite strange and came up with the question, is >= faster than > ?
CPU architecture specific. How can you measure it on modern processors anyway?
However if key is not really an int (that is you anonymized it to one) and there is no specific overloaded operator for <= than the code performance of <= will be much worse than <.
In your specific algorithm, changing between <= and < is going to wreck you algorithm so that’s what happened here.