vault backup: 2023-09-15 14:51:50
This commit is contained in:
parent
b5ec7a1ce4
commit
c297a59106
10
.obsidian/workspace.json
vendored
10
.obsidian/workspace.json
vendored
@ -13,7 +13,7 @@
|
|||||||
"state": {
|
"state": {
|
||||||
"type": "markdown",
|
"type": "markdown",
|
||||||
"state": {
|
"state": {
|
||||||
"file": "Algo/Séminaire/Exercices seminaire.md",
|
"file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
|
||||||
"mode": "source",
|
"mode": "source",
|
||||||
"source": false
|
"source": false
|
||||||
}
|
}
|
||||||
@ -85,7 +85,7 @@
|
|||||||
"state": {
|
"state": {
|
||||||
"type": "backlink",
|
"type": "backlink",
|
||||||
"state": {
|
"state": {
|
||||||
"file": "Algo/Séminaire/Exercices seminaire.md",
|
"file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
|
||||||
"collapseAll": false,
|
"collapseAll": false,
|
||||||
"extraContext": false,
|
"extraContext": false,
|
||||||
"sortOrder": "alphabetical",
|
"sortOrder": "alphabetical",
|
||||||
@ -102,7 +102,7 @@
|
|||||||
"state": {
|
"state": {
|
||||||
"type": "outgoing-link",
|
"type": "outgoing-link",
|
||||||
"state": {
|
"state": {
|
||||||
"file": "Algo/Séminaire/Exercices seminaire.md",
|
"file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
|
||||||
"linksCollapsed": false,
|
"linksCollapsed": false,
|
||||||
"unlinkedCollapsed": true
|
"unlinkedCollapsed": true
|
||||||
}
|
}
|
||||||
@ -125,7 +125,7 @@
|
|||||||
"state": {
|
"state": {
|
||||||
"type": "outline",
|
"type": "outline",
|
||||||
"state": {
|
"state": {
|
||||||
"file": "Algo/Séminaire/Exercices seminaire.md"
|
"file": "Algo/Séminaire/Chapter 5 - Recursivity.md"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
},
|
},
|
||||||
@ -158,8 +158,8 @@
|
|||||||
},
|
},
|
||||||
"active": "0d2d422aa24bb900",
|
"active": "0d2d422aa24bb900",
|
||||||
"lastOpenFiles": [
|
"lastOpenFiles": [
|
||||||
"Algo/Séminaire/Introduction.md",
|
|
||||||
"Algo/Séminaire/Exercices seminaire.md",
|
"Algo/Séminaire/Exercices seminaire.md",
|
||||||
|
"Algo/Séminaire/Introduction.md",
|
||||||
"Algo/Séminaire/Chapter 5 - Recursivity.md",
|
"Algo/Séminaire/Chapter 5 - Recursivity.md",
|
||||||
"Algo/Séminaire/Chapter 3 - Case analysis.md",
|
"Algo/Séminaire/Chapter 3 - Case analysis.md",
|
||||||
"Algo/Séminaire/Chapter 2 - Functions.md",
|
"Algo/Séminaire/Chapter 2 - Functions.md",
|
||||||
|
@ -102,3 +102,6 @@ An accumulator is a thing that try to get our result. In CAML we trying to not u
|
|||||||
| n -> rev (inv*10 + n mod 10)(n/10)
|
| n -> rev (inv*10 + n mod 10)(n/10)
|
||||||
in rev 0 n;;
|
in rev 0 n;;
|
||||||
```
|
```
|
||||||
|
|
||||||
|
## 4.3. Complexity
|
||||||
|
Exemple with egypt (4.10) vs multiply (4.6)
|
@ -355,4 +355,14 @@ let rec multiply x y =
|
|||||||
multiply (x / 2) (y * 2)
|
multiply (x / 2) (y * 2)
|
||||||
else
|
else
|
||||||
y + multiply (x / 2) (y * 2)
|
y + multiply (x / 2) (y * 2)
|
||||||
|
|
||||||
|
(*correction*)
|
||||||
|
# let egypt a b =
|
||||||
|
let (a, b) = if a > b then (a,b) else (b,a) in
|
||||||
|
let rec eg = function
|
||||||
|
| 0 -> 0
|
||||||
|
| b -> 2*eg(b/2) + (if b mod 2 = 0 then 0 else a)
|
||||||
|
in
|
||||||
|
eg b;;
|
||||||
|
|
||||||
```
|
```
|
||||||
|
Loading…
x
Reference in New Issue
Block a user