Skip to content
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

Queues - Andrea Valliere - Recursion Tracing #36

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Queues - Andrea Valliere - Recursion Tracing #36

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3646ab4
Update README.md
avalliere Apr 3, 2017
878c4ca
Update README.md
avalliere Apr 3, 2017
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
50 changes: 25 additions & 25 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,13 +3,13 @@
## Definitions
Define the following:

- Recursion
- Recursive Case
- Base Case
- Activation Chain/Stack
- Activation Record/Call
- Infinite Recursion/Stack Overflow/Stack too deep
- Tail Recursion
- Recursion : a method which calls itself
- Recursive Case : the part of the method where recursion occurs
- Base Case : the point in the method where recursion ceases
- Activation Chain/Stack : all of the activation records of the run of the recursive method
- Activation Record/Call : the data of an iteration of the recursive method
- Infinite Recursion/Stack Overflow/Stack too deep : the base case is unattainable and recursion will not stop until stack is too deep
- Tail Recursion : the recursive step is at the end 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)? Stack Too Deep

### 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,"
Copy link

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

minor, but notable: all these should have a leading space on the front. " moon goodnight", " Academy Developers Ada", " 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")?_