[algogeeks] perfect square condition checking....
please suggest some efficient solution to check perfect square condition . no matter how much large number is... eg..i/p-8949 o/p-93 --
Re: [algogeeks] perfect square condition checking....
Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Sun, Dec 23, 2012 at 9:07 PM, Anil Sharma anilsharmau...@gmail.comwrote: no matter how much large number is still,how large?If it fits in long long int then using binary search we can check this is O(log n) time. --
Re: [algogeeks] perfect square condition checking....
Are you asking for an algorithm for checking perfect square condition without using library functions like sqrt? On Sun, Dec 23, 2012 at 9:07 PM, Anil Sharma anilsharmau...@gmail.comwrote: please suggest some efficient solution to check perfect square condition . no matter how much large number is... eg..i/p-8949 o/p-93 -- -- Regards, Sachin Maheshwari Cell phone: +91.7259917298 If we admit that human life can be ruled by reason; the possibility of life is destroyed. - Alexander Supertramp --
