Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 12 additions & 5 deletions lib/max_subarray.rb
Original file line number Diff line number Diff line change
@@ -1,8 +1,15 @@

# Time Complexity: ?
# 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.

👍

return 0 if nums == nil

raise NotImplementedError, "Method not implemented yet!"
return 0 if nums == nil
current_sum = nums[0]
current_max = current_sum
i = 1
while i < nums.length
current_sum = [current_sum + nums[i], nums[i]].max
current_max = [current_sum, current_max].max
i += 1
end
return current_max
end
22 changes: 18 additions & 4 deletions lib/newman_conway.rb
Original file line number Diff line number Diff line change
@@ -1,7 +1,21 @@


# 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.

👎 😭

# Space Complexity: O(n)
def newman_conway(num)
raise NotImplementedError, "newman_conway isn't implemented"
end
raise ArgumentError if num == 0
return "1" if num == 1
result = "1 1"
n = 3
while n <= num
conway_num = newman_recursive(n)
result += " " + conway_num.to_s
n += 1
end
return result
end

def newman_recursive(n)
return 1 if n <= 2
return newman_recursive(newman_recursive(n - 1)) + newman_recursive(n - newman_recursive(n - 1))

Choose a reason for hiding this comment

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

Take a look at the fibonacci notes in the textbook curriculum on algorithms. This is the same approach as the default recursive solution. Because you're not doing dynamic programming here (solving and saving subproblems for use later), you end up solving the same problems over and over again. This is actually O(33)

end
21 changes: 10 additions & 11 deletions test/max_sub_array_test.rb
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
require_relative "test_helper"

xdescribe "max subarray" do
describe "max subarray" do
it "will work for [-2,1,-3,4,-1,2,1,-5,4]" do
# Arrange
input = [-2,1,-3,4,-1,2,1,-5,4]
input = [-2, 1, -3, 4, -1, 2, 1, -5, 4]

# Act
answer = max_sub_array(input)
Expand All @@ -25,7 +25,7 @@

it "will work with a totally negative array with the largest element at the rear" do
# Arrange
input = [ -4, -5, -6, -7, -3]
input = [-4, -5, -6, -7, -3]

# Act
answer = max_sub_array(input)
Expand All @@ -46,14 +46,14 @@
end

it "will return nil for an empty array" do
# Arrange
input = []
# Arrange
input = []

# Act
answer = max_sub_array(input)
# Act
answer = max_sub_array(input)

# Assert
expect(answer).must_be_nil
# Assert
expect(answer).must_be_nil
end

it "will work for [50, -50, 50]" do
Expand All @@ -66,5 +66,4 @@
# Assert
expect(answer).must_equal 50
end

end
end
51 changes: 25 additions & 26 deletions test/newman_conway_test.rb
Original file line number Diff line number Diff line change
Expand Up @@ -24,31 +24,30 @@
end

it "works with base cases" do
# Arrange
input = 0

# Act-Assert
expect {
newman_conway(input)
}.must_raise ArgumentError


# Arrange
input = 1

# Act
answer = newman_conway(input)

# Assert
expect(answer).must_equal "1"

# Arrange
input = 2

# Act
answer = newman_conway(input)

# Assert
expect(answer).must_equal "1 1"
# Arrange
input = 0

# Act-Assert
expect {
newman_conway(input)
}.must_raise ArgumentError

# Arrange
input = 1

# Act
answer = newman_conway(input)

# Assert
expect(answer).must_equal "1"

# Arrange
input = 2

# Act
answer = newman_conway(input)

# Assert
expect(answer).must_equal "1 1"
end
end