I was solving this question on codeforces, and was getting TLE for large test cases. I read a blog about different implementation for compare function on coderfoces and changed my compare function to the third option.
After reading a comment saying that bigger sq can decrease runtime, so decided to give it a try. And it worked, I changed my sq size to 1000 and code was accepted.
What I want to ask is
- How size of sq ( = sqrt(n) ) changes runtime?
- Should I choose a considerable size myself?
- How can I optimize my code as it is just passing by bare minimum of time limit?
