1 votes 1 votes 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) srivivek95 asked Jan 25, 2018 srivivek95 708 views answer comment Share Follow See all 15 Comments See all 15 15 Comments reply Show 12 previous comments srivivek95 commented Jan 25, 2018 reply Follow Share No. Answer given is O(logn) But I am not getting it 0 votes 0 votes Diksha Aswal commented Jan 25, 2018 reply Follow Share apply binary search and move towards right ..you will reach to the end i.e. to 'n' in O(logn) time. 0 votes 0 votes srivivek95 commented Jan 25, 2018 reply Follow Share @ Diksha Aswal 1 -> 2 -> 4 -> 8 -> 16 ->32 ...... -> 1024 Now, If the last element(#) is at 513 (OR 1023 OR 768 whichever is the worst case), then how to proceed? 0 votes 0 votes Please log in or register to add a comment.