Skip to content

Conversation

@nidhiparixitpatel
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.

Take a look at my comments on the newman conway sequence. Then review the notes on Fibonacci sequence. You did things in a very inefficient manner. See if you can identify why.

Max subarray was well done.

if num < 3
return 1
else
num = get_newman_num(get_newman_num(num - 1)) + get_newman_num(num - get_newman_num(num - 1))

Choose a reason for hiding this comment

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

Because you're not saving the subproblems anywhere, you end up solving the problems over and over like Fibonacci sequence. So this is MUCH worse than O(n). I believe this is actually O(3n) since you are making 3 recursive calls at each level.

# Space Complexity: ?
# Time Complexity: O(n)
# Space Complexity: O(1)
def max_sub_array(nums)

Choose a reason for hiding this comment

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

👍

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