given an array E.The first n cells of the array contain intergers sorted in increasing order.The remaining cells all contain some very large integer that yu may think of as infinity(call it maxint) .The array may be arbitrarily large(you may think of it as infinite),and you dont know n.Given an algorithm to find the position of a given integer x(x<maxint) in the array in O(logn) time.
rakeshroxx 0 Newbie Poster
Salem 5,199 Posting Sage
So what's our benefit in solving your homework?
You do know that the whole array is sorted right?
rakeshroxx 0 Newbie Poster
please help me in doing this...
Salem 5,199 Posting Sage
True or false:
The entire array (not just the first n elements) is sorted.
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.