Skip to content

Ashton Recursion-Tracing #35

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ashtn wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Ashton Recursion-Tracing #35

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
52 changes: 26 additions & 26 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,15 +1,15 @@
# Recursion Problems

## Definitions
Define the following:
Define the following:

- Recursion
- Recursive Case
- Base Case
- Activation Chain/Stack
- Activation Record/Call
- Infinite Recursion/Stack Overflow/Stack too deep
- Tail Recursion
- Recursion - Recursion is when a method is called within itself
- Recursive Case - A Recursive case is a specific operation in the method where the recursion is happing.
- Base Case - A base case is the stopping operation of the method that does not use recursion to produce an answer.
- Activation Chain/Stack - The process of finding the output, recording and reassigning the value for each parameter
- Activation Record/Call - For the lack of a better explanation, a bubble.
- Infinite Recursion/Stack Overflow/Stack too - deep - This is when there is no stopping point and/or no possibility of hitting the base case.
- Tail Recursion - Tail Recursion is when recursion is called in the last operation of the method.

## Tracing through a recursive method

Expand All @@ -24,9 +24,9 @@ def mystery1(n)
end
```

- What is mystery1(5)?
- What is mystery1(10)?
- What is mystery1(0)?
- What is mystery1(5)? _15_
- What is mystery1(10)? _55_
- What is mystery1(0)? _Infinite Recursion / Stack Overflow_

### Trace #2
```
Expand All @@ -39,9 +39,9 @@ def mystery2(n)
end
```

- What is mystery2(123)?
- What is mystery2(9005)?
- What is mystery2(-123)?
- What is mystery2(123)? _6_
- What is mystery2(9005)? _14_
- What is mystery2(-123)? _-123_
- _Added Fun: How could we make `mystery2(-123)` work the way we might expect it to work instead of the way it does?_

### Trace #3
Expand All @@ -60,9 +60,9 @@ def mystery3(n)
end
```

- What is mystery3(1)?
- What is mystery3(13)?
- What is mystery3(-6)?
- What is mystery3(1)? _100_
- What is mystery3(13)? _100_
- What is mystery3(-6)? _200_

### Trace #4
```
Expand All @@ -75,9 +75,9 @@ def mystery4(b,e)
end
```

- What is mystery4(10,2)?
- What is mystery4(4,3)?
- What is mystery4(5,0)?
- What is mystery4(10,2)? _100_
- What is mystery4(4,3)? _64_
- What is mystery4(5,0)? _1_

### Trace #5
```
Expand All @@ -90,9 +90,9 @@ def mystery5(s)
end
```

- What is mystery5("hi")?
- What is mystery5("")?
- What is mystery5("Hi, there!")?
- What is mystery5("hi")? _"**"_
- What is mystery5("")? _""_
- What is mystery5("Hi, there!")? _"*********"_
- _Added Fun: How could we make only alphabetic characters to be changed to stars?_

### Trace #6
Expand All @@ -110,7 +110,7 @@ def mystery6(s)
end
```

- What is mystery6("goodnight moon")?
- What is mystery6("Ada Developers Academy")?
- What is mystery6("Hi, there!")?
- What is mystery6("goodnight moon")? _" moon goodnight"_
- What is mystery6("Ada Developers Academy")? _" Academy Developers Ada"_
- What is mystery6("Hi, there!")? _" there! Hi,"
- _Added Fun: How could we make the reversal happen by letter, instead of by word (i.e. Make it so that mystery6("goodnight moon") returned "noom thgindoog")?_