1 vote

An array of unknown size is filled with special symbols let's say '#'. Time required to find the size of array is

1) O(1)

2) O(logn)

3) O(n)

4) O((logn)^{2})

0

I think it would take O(logn)

Traverse it exponentially, i.e traverse with modification in Binary search

Traverse it exponentially, i.e traverse with modification in Binary search

0

let

S is an array...then...let starting address is 100 and having 5 element of 1 byte...then

&S+1 will return 100+5*1=105....now conside.. S=100

calculate....105-100= **5/size of an element .....**

**and for given question this ia character...therefro we will assume size is 1 byte..**

0

1 -> 2 -> 4 -> 8 -> 16 ->32 ...... -> 1024

Now, If the last element is 513 (OR 1023 OR 768 whichever is the worst case), then how to proceed?

Now, If the last element is 513 (OR 1023 OR 768 whichever is the worst case), then how to proceed?

0