hi asish & varun_dale,
thanks for ur reply..
@asish,
But ur code takes O(n logn) to find the missing integer.
The binaryToNum() will returns num in O(log n ) complexity.
And there is a small mistake in ur code is " it is not i =
i/10, it should be i = i/2 "
@varun_dale,
I think ur proposed algo. also will takes O(n logn ), if
not just explain me in the pseudocode form.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
