Skip to content
Open
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
50 changes: 25 additions & 25 deletions README.md
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 function that calls itself (see recursion)
- Recursive Case: The function that is called within itself, should bring you closer to the base case.
- Base Case: the base case is what stops the recursion from infinite recursion
- Activation Chain/Stack - This still isn't clear to me
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

This is the series of recursive calls that have to be made to solve a recursive problem. So the chain of "bubbles".

- Activation Record/Call - This still isn't clear to me
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

An activiation record is a single call of the recursive method. So one "bubble" if you will.

- Infinite Recursion/Stack Overflow/Stack too deep: Recursion that would go on forever
- Tail Recursion: With each evaluation of the recursive call, the running total is updated.
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

this is not correct - but we hadn't covered in class


## 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

### 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 Ada Developers"
- 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")?_