Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
88 changes: 62 additions & 26 deletions lib/recursive-methods.rb
Original file line number Diff line number Diff line change
@@ -1,49 +1,85 @@
# Authoring recursive algorithms. Add comments including time and space complexity for each method.

# Time complexity: ?
# Space complexity: ?
require "pry"
# Time complexity: O(n)
# Space complexity: O(n)
def factorial(n)
raise NotImplementedError, "Method not implemented"
raise ArgumentError if n < 0
return 1 if n == 0 || n == 1
return n * factorial(n - 1)
end

# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n) where n is the length of the string
# Space complexity: O(n) where n is the length of the string
def reverse(s)
raise NotImplementedError, "Method not implemented"
return s if s.length <= 1
return s[-1] + reverse(s[0..s.length - 2])
end

# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n) where n is the length of the string
# Space complexity: O(n) where n is the length of the string
def reverse_inplace(s)
raise NotImplementedError, "Method not implemented"
return s if s.length <= 1
return s[-1] + reverse(s[0..s.length - 2])
end

# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n)
# Space complexity: O(n)
def bunny(n)
raise NotImplementedError, "Method not implemented"
if n == 0
return 0
else
return 2 + bunny(n - 1)
end
end

# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n) where n is the length of the string
# Space complexity: O(n) where n is the length of the string
def nested(s)
raise NotImplementedError, "Method not implemented"
if s.length == 0
return true
else
if s[0] != s[-1]
nested(s[1..-2])
else
return false
end
end
end

# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n) where n is the length of the array
# Space complexity: O(n) where n is the length of the array
def search(array, value)
raise NotImplementedError, "Method not implemented"
return false if array.length == 0
if array[0] == value
return true
else
search(array[1..-1], value)
end

# else
end

# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n) where n is the length of the string
# Space complexity: O(n) where n is the length of the string
def is_palindrome(s)
raise NotImplementedError, "Method not implemented"
if s.length == 1 || s.length == 0
return true
else
if s[0] == s[-1]
is_palindrome(s[1..-2])
else
return false
end
end
end

# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n) where n is the length of the longer array
# Space complexity: O(n) where n is the length of the longer array
def digit_match(n, m)
raise NotImplementedError, "Method not implemented"
end
counter = 0
return counter if n[-1] == nil || n[-2] == nil
if n[-1] == m[-1]
counter += 1
digit_match[n[0..-2], m[0..-2]]
end
end
80 changes: 39 additions & 41 deletions specs/recursion_writing_spec.rb
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
require 'minitest/autorun'
require 'minitest/reporters'
require "minitest/autorun"
require "minitest/reporters"
require "minitest/skip_dsl"
require_relative '../lib/recursive-methods'
require_relative "../lib/recursive-methods"

describe "factorial" do
it "will find the factorial of 0" do
Expand All @@ -23,8 +23,7 @@
answer = factorial(num)

# Assert
expect(answer).must_equal 5*4*3*2*1

expect(answer).must_equal 5 * 4 * 3 * 2 * 1
end

it "will raise an ArgumentError if given a number not >= 0" do
Expand All @@ -38,7 +37,7 @@
end
end

xdescribe "reverse" do
describe "reverse" do
it "will reverse 'cat'" do
# Arrange
string = "cat"
Expand Down Expand Up @@ -83,8 +82,7 @@
end
end


xdescribe "reverse_in_place" do
describe "reverse_in_place" do
it "will reverse 'cat'" do
# Arrange
string = "cat"
Expand Down Expand Up @@ -129,7 +127,7 @@
end
end

xdescribe "bunny" do
describe "bunny" do
it "returns 0 for 0 bunnies" do
# Arrange
count = 0
Expand Down Expand Up @@ -164,7 +162,7 @@
end
end

xdescribe "nested" do
describe "nested" do
it "will return true for empystring" do
# Arrange
string = ""
Expand Down Expand Up @@ -210,7 +208,7 @@
end
end

xdescribe "search" do
describe "search" do
it "will return false for empty array" do
# Arrange
item = "a"
Expand All @@ -224,43 +222,43 @@
end

it "will return true when looking for something in the array" do
# Arrange
item = "a"
array = ["b", "c", "a"]
# Arrange
item = "a"
array = ["b", "c", "a"]

# Act
answer = search(array, item)
# Act
answer = search(array, item)

# Assert
expect(answer).must_equal true
# Assert
expect(answer).must_equal true
end

it "will return false when looking for something not in the array" do
# Arrange
item = "x"
array = ["b", "c", "a"]

# Act
answer = search(array, item)

# Assert
expect(answer).must_equal false
end

it "will return true when finding something at the front of the array" do
# Arrange
item = "b"
array = ["b", "c", "a"]
# Act
answer = search(array, item)
# Assert
expect(answer).must_equal true
end
end

it "will return true when finding something at the front of the array" do
# Arrange
item = "b"
array = ["b", "c", "a"]

# Act
answer = search(array, item)

# Assert
expect(answer).must_equal true
end
end

xdescribe "is_palindrome" do
describe "is_palindrome" do
it "will return true for emptystring" do
# Arrange
string = ""
Expand Down Expand Up @@ -304,8 +302,8 @@
# Act
answer = digit_match(num1, num2)

# Assert
expect(answer).must_equal 4
# Assert
expect(answer).must_equal 4
end

it "returns 0 for nonmatching numbers" do
Expand All @@ -316,8 +314,8 @@
# Act
answer = digit_match(num1, num2)

# Assert
expect(answer).must_equal 0
# Assert
expect(answer).must_equal 0
end

it "returns 3 for 841 and 62530841" do
Expand All @@ -328,7 +326,7 @@
# Act
answer = digit_match(num1, num2)

# Assert
expect(answer).must_equal 3
# Assert
expect(answer).must_equal 3
end
end
end