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 wrote:
> please suggest some efficient solution to check perfect square condition .
> no matter how much large number is... eg..i/p-8949 o
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Sun, Dec 23, 2012 at 9:07 PM, Anil Sharma wrote:
> 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.
--
please suggest some efficient solution to check perfect square condition .
no matter how much large number is... eg..i/p-8949 o/p-93
--
