CareerCup

if array is sorted increasingly then go to last element, O(1);
else O(n).

I dont think it would be that straight-forward !! (given the company name) :p

@Anonymous.... are we missing something here ?? Some other constraint in the question ?

what is 5,..,15,..,15,..,15...,..,15,....

I think in actual question we are given some pattern then we need to find nth element otherwise he's sure to have missed something

if array is sorted then $(1).
if any other pattern is given then may be $(1) < complexity O(n).
if no patten is given then surely its $(n).

$ = theta

This comment has been deleted.

Common people , dont paste a problem unless you understand of the question please !!!1

definately something is missed here. it cant be that simple.

I think we need to find an integer which occurs the maximum number of times.