0 0 votes Better than O(n) exists ? Algorithms array time-complexity + – HeadShot 474 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply goxul commented Dec 1, 2018 reply Follow flag Doubt it can be better than $O(n)$. You'll have to look at all the integers at least once. 1 1 replyShare OneZero commented Dec 1, 2018 reply Follow flag @HeadShot I think its O(n) because the problem is similar to finding max element in unsorted which takes O(n). NOT SURE THO. 1 1 replyShare Please log in or register to add a comment.
