finished assignment

Gemfile.lock

@@ -0,0 +1,36 @@
+GEM
+  remote: https://rubygems.org/
+  specs:
+    ansi (1.5.0)
+    builder (3.2.4)
+    coderay (1.1.3)
+    method_source (1.0.0)
+    minitest (5.14.2)
+    minitest-reporters (1.4.2)
+      ansi
+      builder
+      minitest (>= 5.0)
+      ruby-progressbar
+    minitest-skip (0.0.3)
+      minitest (~> 5.0)
+    minitest-spec (0.0.2.1)
+      minitest (>= 3.0)
+    pry (0.13.1)
+      coderay (~> 1.1)
+      method_source (~> 1.0)
+    rake (13.0.1)
+    ruby-progressbar (1.10.1)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  minitest
+  minitest-reporters
+  minitest-skip
+  minitest-spec
+  pry
+  rake
+
+BUNDLED WITH
+   2.1.4

lib/recursive-methods.rb

@@ -1,27 +1,49 @@
 # Authoring recursive algorithms. Add comments including time and space complexity for each method.
 
-# Time complexity: ?
-# Space complexity: ?
+# Time complexity: o(n)
+# Space complexity: o(n)
 def factorial(n)
-    raise NotImplementedError, "Method not implemented"
+
+    if n == 0 || n == 1
+        return 1
+    elsif n < 0
+        raise ArgumentError, " Enter a number greater than 0."
+    else
+        return n * factorial(n - 1)
+    end
 end
 
-# Time complexity: ?
-# Space complexity: ?
+# Time complexity: o(n) - N being the length of string
+# Space complexity: o(n) - we would need n amount of space for each character in string
 def reverse(s)
-    raise NotImplementedError, "Method not implemented"
+    if s.length <= 1
+        return s
+    else
+        return reverse(s[1..-1]) + s[0]
+    end
+
 end
 
-# Time complexity: ?
-# Space complexity: ?
+# Time complexity: o(n) - n being how long the string is
+# Space complexity: o(n) - n ammout of space for each char in string
 def reverse_inplace(s)
-    raise NotImplementedError, "Method not implemented"
+    if s.length <= 1
+        return s
+    else
+        return s[-1] + reverse(s[1..-2]) + s[0]
+    end
 end
 
-# Time complexity: ?
-# Space complexity: ?
+# Time complexity: o(n)
+# Space complexity: o(n
 def bunny(n)
-    raise NotImplementedError, "Method not implemented"
+    return n if n == 0
+
+    if n == 1
+        return 2
+    else
+        return 2 + bunny(n - 1)
+    end
 end
 
 # Time complexity: ?
@@ -30,20 +52,40 @@ def nested(s)
     raise NotImplementedError, "Method not implemented"
 end
 
-# Time complexity: ?
-# Space complexity: ?
+# Time complexity: o(n)
+# Space complexity: o(n)
 def search(array, value)
-    raise NotImplementedError, "Method not implemented"
+    if array.length == 0
+        return false
+    elsif array[0] == value
+        return true
+    else
+        return search(array[1..-1], value)
+    end
 end
 
-# Time complexity: ?
-# Space complexity: ?
+# Time complexity: o(n)
+# Space complexity: o(n)
 def is_palindrome(s)
-    raise NotImplementedError, "Method not implemented"
+    if s.length <= 1
+        return true
+    elsif s[0] != s[-1]
+        return false
+    else
+        return is_palindrome(s[1..-2])
+    end
 end
 
-# Time complexity: ?
-# Space complexity: ?
+# Time complexity: o(n)
+# Space complexity: o(n)
 def digit_match(n, m)
-    raise NotImplementedError, "Method not implemented"
+    n = n.to_s
+    m = m.to_s
+    if n.length == 0 || m.length == 0
+        return 0
+    elsif n[-1] == m[-1]
+        return 1 + digit_match(n[0..-2], m[0..-2])
+    else
+        return digit_match(n[0..-2], m[0..-2])
+    end
 end