Skip to content

Conversation

@CEsGutierrez
Copy link

No description provided.

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.

Awesome work! You hit all the learning goals here. Well done.

Comment on lines +2 to +8
# Time Complexity: O(n)
## The method iterates over the entire array but does so only once

# Space Complexity: O(1)
## There are a limited number of variables that are constantly being re-assessed, so as the input goes to infitity the space requirements do not grow.

def max_sub_array(number_array)

Choose a reason for hiding this comment

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

👍

Comment on lines +3 to 8
# Time complexity: O(n)
## As the number goes to infinity, its values have to be assessed relative to whatever's already in the array, but because it's based on an array, the look-up cost is very low given that an index value is being passed in.
# Space Complexity: O(n)
## As the number goes to infinity, the amount of space will grow at the same rate

def newman_conway(num)

Choose a reason for hiding this comment

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

👍 Awesome work 😃

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