diff --git a/lib/max_subarray.py b/lib/max_subarray.py
index 4e892e0..8d86717 100644
--- a/lib/max_subarray.py
+++ b/lib/max_subarray.py
@@ -2,11 +2,17 @@
 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
+    cur_sub=max_sub=nums[0]
+        
+    for num in nums[1:]:
+        cur_sub = max(num,cur_sub+num)
+        max_sub = max(max_sub,cur_sub)
+            
+    return max_sub
diff --git a/lib/newman_conway.py b/lib/newman_conway.py
index 70a3353..c68042c 100644
--- a/lib/newman_conway.py
+++ b/lib/newman_conway.py
@@ -1,10 +1,27 @@
 
-
-# Time complexity: ?
-# 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'
+
+    memo = [None] * (num + 1)
+
+    memo[0] = 0
+    memo[1] = 1
+    memo[2] = 1
+
+    i = 3
+    while i <= num:
+        memo[i] = memo[memo[i-1]] + memo[i - memo[i - 1]]
+        i += 1
+
+    result = "" + str(memo[1])
+    for i in range(2, len(memo)):
+        result += " " + str(memo[i])
+
+    return result