You can do it very easily.
I assume array is sorted and contains integers.
Say start at position 1, if value at that index is equal to the value to be
found, return index.
else if value at that index is greater than the value to be found, we got an
interval to search in.
else(value at that index
I forgot to mention one thing, at each comparison, store the index at which
we searched previously.
Sanju
:)
On Fri, Aug 19, 2011 at 10:53 AM, Sanjay Rajpal srn...@gmail.com wrote:
You can do it very easily.
I assume array is sorted and contains integers.
Say start at position 1, if
@Sanjay
yeah its the very basic idea that comes in mind
but is your index searching log n ?
i think no !!
if yes then tell me how?
On Fri, Aug 19, 2011 at 11:24 PM, Sanjay Rajpal srn...@gmail.com wrote:
I forgot to mention one thing, at each comparison, store the index at which
we searched
See at each step you are multiplying the index to be compared by 10(say),
this increase is exponential.
Therefore the search is exponential and complexity is log n. Base depends on
the factor by which you are multiplying for the next index to be compared.
Sanju
:)
On Fri, Aug 19, 2011 at 10:57
hmmm ok
i found a solution in which index searching is done by 2^i
which is more optimal
multiplication by 10 or 2 power i ??i=0,1,2,3.
On Fri, Aug 19, 2011 at 11:30 PM, Sanjay Rajpal srn...@gmail.com wrote:
See at each step you are multiplying the index to be compared by 10(say),
this
Well i think it depends...
because range of x and 10x is more than i and 2i
no doubt multiple of 10 will give us early index but then to find number in
b/w indexes is more than of 2^i
On Fri, Aug 19, 2011 at 11:38 PM, Sanjay Rajpal srn...@gmail.com wrote:
Multiplication by 10 or 2^i , it
Thats wat I said, it depends. Searching in the interval will compensate
reaching the index earlier.
So both are almost equivalent.
Sanju
:)
On Fri, Aug 19, 2011 at 11:12 AM, sagar pareek sagarpar...@gmail.comwrote:
Well i think it depends...
because range of x and 10x is more than i and
:)
On Fri, Aug 19, 2011 at 11:43 PM, Sanjay Rajpal srn...@gmail.com wrote:
Thats wat I said, it depends. Searching in the interval will compensate
reaching the index earlier.
So both are almost equivalent.
Sanju
:)
On Fri, Aug 19, 2011 at 11:12 AM, sagar pareek
