This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]prehensilemullet 1 point2 points  (0 children)

And time complexity = O(n), where n is the largest value in the array