mirror of
https://github.com/Brandon-Rozek/website.git
synced 2024-11-09 10:40:34 -05:00
Added corecursion example
This commit is contained in:
parent
5b0f61fa0a
commit
e6836e2914
1 changed files with 7 additions and 0 deletions
|
@ -145,6 +145,13 @@ Notice how the function within `unfold` needs to return an `Option`. If the retu
|
|||
val countdown = (n: Int) => Iterator.unfold(n)(x => if x == -1 then None else Some((x, x - 1)))
|
||||
```
|
||||
|
||||
**(4) Repeat an element forever**
|
||||
|
||||
For this example, we don't need to carry any state throughout hte computation.
|
||||
```scala
|
||||
val repeat: (Int => Iterator[Int]) = (n) => Iterator.unfold(None)(_ => Some(n, None))
|
||||
```
|
||||
|
||||
## Recursive Sequences
|
||||
|
||||
In the past, [I've written](/blog/haskellrealsequences/) about analyzing sequences from real analysis within Haskell. Within it, I was looking at the following sequence:
|
||||
|
|
Loading…
Reference in a new issue