-
Notifications
You must be signed in to change notification settings - Fork 41
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
C. Gutierrez #30
base: master
Are you sure you want to change the base?
C. Gutierrez #30
Conversation
There was a problem hiding this 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.
# 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) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# 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) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Awesome work 😃
No description provided.