From 78b4a692223f07ae9265be80722cc54790a8e62b Mon Sep 17 00:00:00 2001 From: Louis Date: Sun, 29 Oct 2023 15:40:19 +0100 Subject: [PATCH] vault backup: 2023-10-29 15:40:19 --- Algo/Courses/Chapter 6 - Lists.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Algo/Courses/Chapter 6 - Lists.md b/Algo/Courses/Chapter 6 - Lists.md index ccf72cb..0df7ffa 100644 --- a/Algo/Courses/Chapter 6 - Lists.md +++ b/Algo/Courses/Chapter 6 - Lists.md @@ -87,7 +87,7 @@ _: int list = [1 ; 2 ; 3; 4] ## List manipulation ### Traverse -Sequential traverse have to solution, first is the list is empty, then you stop. Else if the list is not empty, we extract the head and the tail, we treat the head and we traverse the trail (rec call) +Sequential traverse have two solution, first is the list is empty, then you stop. Else if the list is not empty, we extract the head and the tail, we treat the head and we traverse the trail (rec call) ```Ocaml # let p = (1, 2);; val p: int*int = (1,2)