0 votes 0 votes An array A of unknown size is filled with special symbols let say ‘#’ . Time required to find the size of A is: (A) O(1) (B) O(logn) (C) O(n) (D) O((logn)$^{2}$) Rajat Agrawal007 asked Dec 19, 2018 Rajat Agrawal007 341 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply shreyansh jain commented Dec 19, 2018 i edited by shreyansh jain Dec 19, 2018 reply Follow Share $O(logn)$ 0 votes 0 votes Mizuki commented Dec 19, 2018 reply Follow Share @shreyansh jain How to compute/? 0 votes 0 votes shreyansh jain commented Dec 19, 2018 i edited by shreyansh jain Dec 19, 2018 reply Follow Share Just to give you a vague idea.. Start with index 1. Traverse in powers of 2 (something like binary search). 1 votes 1 votes anjali007 commented Dec 19, 2018 reply Follow Share we should just perform a search for # and find the first and last occurence of # which can be done with the help of binary search so it will take O(logn) time 1 votes 1 votes Please log in or register to add a comment.