diff options
| -rw-r--r-- | src/gleam/list.gleam | 8 |
1 files changed, 0 insertions, 8 deletions
diff --git a/src/gleam/list.gleam b/src/gleam/list.gleam index 9a875d0..362156b 100644 --- a/src/gleam/list.gleam +++ b/src/gleam/list.gleam @@ -1443,14 +1443,6 @@ pub fn partition( /// [[1, 2], [2, 1]] /// ``` /// -/// Notice, that this function is not tail recursive: -/// -/// The execution limits on permutations are iterations rather than stack size; -/// for a permutation with `10` items a non tail recursive algorithm will at -/// worst built up a stack size of `10` before it goes back to `1` eventually, -/// while a permutation of say `5_000` items will not compute, in reasonable -/// time, despite not exceeding stack size. -/// pub fn permutations(l: List(a)) -> List(List(a)) { case l { [] -> [[]] |