Skip to content

Conversation

@M-Burr
Copy link

@M-Burr M-Burr commented Sep 17, 2019

completed cs homework

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

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

Nice job. Both methods work and you have accurate Big-O. Do see my comments and let me know if you have questions.

Well done!


# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(n^2)

Choose a reason for hiding this comment

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

Correct!


# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(n)

Choose a reason for hiding this comment

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

If the words are small this is O(n), otherwise I would say the time complexity is O(mn) where m is the length of the words.

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