We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I dont know wether this will increase significant amount of performance. but rather than performing checks on all the integers in between we can find the square root of first square number in given range and then increase it by one untill its square is not exceeding the given range.
So we can save number of iterrations, and checks we have to performe. guess it will reduce the number of iterrations atleast by 40%.
Thanx...
Sherlock and Squares
You are viewing a single comment's thread. Return to all comments →
I dont know wether this will increase significant amount of performance. but rather than performing checks on all the integers in between we can find the square root of first square number in given range and then increase it by one untill its square is not exceeding the given range.
So we can save number of iterrations, and checks we have to performe. guess it will reduce the number of iterrations atleast by 40%. Thanx...