Skip to content

Update readme wording #52

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

Merged
merged 2 commits into from
Dec 4, 2016
Merged

Update readme wording #52

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
0728582
Modify readme wording
mybrainishuge Dec 4, 2016
3ea8899
Update readme title
mybrainishuge Dec 4, 2016
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
6 changes: 3 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
# Recursion
# Recursion Prompts

### **What is this?**
This is a repository of toy problems to be solved using recursion and JavaScript. While the concept of recursion may not be difficult to grasp, the only way to improve at thinking recursively is by practice. If you need practice, then maybe this repo is for you.
Expand Down Expand Up @@ -41,7 +41,7 @@ Is it a true definition? Mostly. Recursion is when a function calls itself. A re
- A **`base`** case
- A **`recursive`** case

_What does this all mean? Let's consider a silly example:_
_What does this all mean?_ Let's consider a silly example:
```sh
function stepsToZero(n) {
if (n === 0) { // base case
Expand Down Expand Up @@ -83,6 +83,6 @@ Recursion isn't unique to any one programming language. As a software engineer,


### Divide and Conquer
Recursion is often used in _divide and conquer_ algorithms where problems can be divided into similar subproblems and conquered individually. Think about traversing a tree. Each branch may have its own "children" branches. Since a child branch is just another branch, then we can recurse on each child. In other words, a tree is essentially made of many smaller trees.
Recursion is often used in _divide and conquer_ algorithms where problems can be divided into similar subproblems and conquered individually. Consider traversing a tree structure. Each branch may have its own "children" branches. And every branch is essentually just another tree which means, as long as child trees are found, we can recurse on each child.

[inception]: <https://en.wikipedia.org/wiki/Inception>