diff --git a/lib/max_subarray.py b/lib/max_subarray.py
index 4e892e0..f03eaf2 100644
--- a/lib/max_subarray.py
+++ b/lib/max_subarray.py
@@ -2,11 +2,18 @@
 def max_sub_array(nums):
     """ Returns the max subarray of the given list of numbers.
         Returns 0 if  nums is None or an empty list.
-        Time Complexity: ?
-        Space Complexity: ?
+        Time Complexity: O(n) where n is len(nums)
+        Space Complexity: O(1)
     """
     if nums == None:
         return 0
     if len(nums) == 0:
         return 0
-    pass
+
+    max_so_far = nums[0]
+    curr_max = nums[0]
+    for i in range(1, len(nums)):
+        curr_max = max(curr_max + nums[i], nums[i])
+        max_so_far = max(max_so_far, curr_max)
+    return max_so_far
+
diff --git a/lib/newman_conway.py b/lib/newman_conway.py
index 70a3353..9dff9b9 100644
--- a/lib/newman_conway.py
+++ b/lib/newman_conway.py
@@ -1,10 +1,21 @@
-
-
 # Time complexity: ?
 # Space Complexity: ?
 def newman_conway(num):
-    """ Returns a list of the Newman Conway numbers for the given value.
-        Time Complexity: ?
-        Space Complexity: ?
+    """Returns a list of the Newman Conway numbers for the given value.
+    Time Complexity: O(n) where n is num
+    Space Complexity: O(n) where n is num
     """
-    pass
+    if num <= 0:
+        raise ValueError
+
+    if num == 1:
+        return "1"
+
+    nums = [0, 1, 1]
+
+    i = 3
+    while i <= num:
+        nums.append(nums[nums[i - 1]] + nums[i - nums[i - 1]])
+        i += 1
+
+    return " ".join([str(n) for n in nums[1:]])