there is an array with m elements... it is known that first n elements are sorted... but dont know what is 'n'.... n<<m
given an element x find whether x is there in sorted elements. Can this be done in O(log n)?? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
