Mona

lib/max_subarray.rb

@@ -1,8 +1,16 @@
 
-# Time Complexity: ?
-# Space Complexity: ?
+# Time Complexity: o(n)
+# Space Complexity: o(1)
+
 def max_sub_array(nums)
     return 0 if nums == nil
 
-    raise NotImplementedError, "Method not implemented yet!"
-end
+    largest_sum = nums[0] #global max sub array 
+    current = nums[0] #curren max sub array 
+
+    (nums[1..-1]).each do |num|
+    current = [num, current + num].max 
+    largest_sum = [largest_sum, current].max
+    end
+    return largest_sum
+end

lib/newman_conway.rb

@@ -1,7 +1,20 @@
 
 
-# Time complexity: ?
-# Space Complexity: ?
+# Time complexity: 0(n)
+# Space Complexity: 0(n)
 def newman_conway(num)
-  raise NotImplementedError, "newman_conway isn't implemented"
-end
+  raise ArgumentError if num <= 0
+  return "1" if num == 1
+  return "1 1" if num == 2
+
+  result = [0, 1, 1]
+  i = 3
+
+  while i <= num
+    result << result[result[i - 1]] + result[i - result[i - 1]] #P(n) = P(P(n - 1)) + P(n - P(n - 1))
+    i += 1
+  end
+  p result
+
+  result[1..-1].join(' ') # remove 0 
+end