Skip to content

Commit af6dfbe

Browse files
Merge pull request JS-Challenges#52 from mybrainishuge/master
Update readme wording
2 parents 464fef8 + 3ea8899 commit af6dfbe

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Recursion
1+
# Recursion Prompts
22

33
### **What is this?**
44
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.
@@ -41,7 +41,7 @@ Is it a true definition? Mostly. Recursion is when a function calls itself. A re
4141
- A **`base`** case
4242
- A **`recursive`** case
4343

44-
_What does this all mean? Let's consider a silly example:_
44+
_What does this all mean?_ Let's consider a silly example:
4545
```sh
4646
function stepsToZero(n) {
4747
if (n === 0) { // base case
@@ -83,6 +83,6 @@ Recursion isn't unique to any one programming language. As a software engineer,
8383
8484
8585
### Divide and Conquer
86-
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.
86+
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.
8787
8888
[inception]: <https://en.wikipedia.org/wiki/Inception>

0 commit comments

Comments
 (0)