diff --git a/lib/max_subarray.py b/lib/max_subarray.py
index 4e892e0..9b0a200 100644
--- a/lib/max_subarray.py
+++ b/lib/max_subarray.py
@@ -2,11 +2,15 @@
 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)
+        Space Complexity: O(1)
     """
-    if nums == None:
-        return 0
-    if len(nums) == 0:
-        return 0
-    pass
+    max_sub_array = 0
+    sum = 0
+
+    for num in nums:
+        sum = max(0, sum + num)
+        max_sub_array = max(max_sub_array, sum)
+        if max_sub_array <= 0:
+            return max(nums)
+        return max_sub_array
\ No newline at end of file
diff --git a/lib/newman_conway.py b/lib/newman_conway.py
index 70a3353..457053d 100644
--- a/lib/newman_conway.py
+++ b/lib/newman_conway.py
@@ -4,7 +4,18 @@
 # Space Complexity: ?
 def newman_conway(num):
     """ Returns a list of the Newman Conway numbers for the given value.
-        Time Complexity: ?
-        Space Complexity: ?
+        Time Complexity: O(n)
+        Space Complexity: O(n)
     """
-    pass
+    if num == 0:
+        raise ValueError
+
+    if num == 1:
+        return "1"
+
+    seq = [0, 1, 1]
+    for i in range(3, num + 1):
+        next_num = seq[seq[i-1]] + seq[i - seq[i-1]]
+        seq.append(next_num)
+
+    return ' '.join([str(n) for n in seq[1:num+1]])
\ No newline at end of file