ben
/
collatz
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Update README.md

This commit is contained in:
Ben Harris 2016-09-11 01:40:12 -04:00
parent dd1bac08c8
commit c8b1f81370
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -14,7 +14,7 @@ For example.
### Your mission is to find the starting number that is less than 1,000,000 with the longest sequence.
This might take a long time. To make it faster, you might cache previous
answers. Suppose you have an array prev[]. Prev[n] is the length of the
answers. Suppose you have an array `prev[]`. `Prev[n]` is the length of the
sequence starting at n. If, when computing a sequence, you ever get to a
number with a value in `prev[]`, you can use that instead of continuing the
computation.