Skip to content

Conversation

@naab-c
Copy link

@naab-c naab-c commented Jul 31, 2017

No description provided.

}
}

Time Complexity: O(1) if n < 10. O(n) if n > 10
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Here you can just say it's O(n), since big O only cares about large values of n anyway. (no need to change your solution, just an FYI)

@mmmaaatttttt mmmaaatttttt reopened this Aug 1, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants