Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com
On Sun, Dec 23, 2012 at 9:07 PM, Anil Sharma <anilsharmau...@gmail.com>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. --
