From a52d0b4cc48ef04672f7aa04f2d22aaa0ebf57de Mon Sep 17 00:00:00 2001
From: Orestis <orestis.malaspinas@pm.me>
Date: Fri, 12 May 2023 09:17:11 +0200
Subject: [PATCH] updated course
---
slides/cours_18.md | 2 ++
slides/cours_19.md | 6 +++---
2 files changed, 5 insertions(+), 3 deletions(-)
diff --git a/slides/cours_18.md b/slides/cours_18.md
index 101b986..15f609f 100644
--- a/slides/cours_18.md
+++ b/slides/cours_18.md
@@ -21,6 +21,8 @@ date: "2023-03-31"
# AVL ou pas?
+\footnotesize
+
```{.mermaid format=pdf width=400 loc=figs/}
graph TD;
id0((21))-->id1((9));
diff --git a/slides/cours_19.md b/slides/cours_19.md
index 22e0348..617f829 100644
--- a/slides/cours_19.md
+++ b/slides/cours_19.md
@@ -321,7 +321,7 @@ int depth(node *qt) {
-* Quelle feuille?
+* Quelle feuille pour 31 (`li=2`, `co=3`)?
* Plus important: quel chemin?
. . .
@@ -368,7 +368,7 @@ int depth(node *qt) {
```C
noeud position(li, co, arbre)
d = profondeur(arbre);
- tant_que (d > 1)
+ tant_que (d >= 1)
index = 2 * ((li % 2^d) / 2^(d-1)) +
(col % 2^d) / 2^(d-1)
arbre = arbre.enfant[index]
@@ -390,7 +390,7 @@ noeud position(li, co, arbre)
```C
noeud position(li, co, arbre)
d = profondeur(arbre);
- tant_que (d > 1)
+ tant_que (d >= 1)
index = 2 * ((li % 2^d) / 2^(d-1)) +
(col % 2^d) / 2^(d-1)
arbre = arbre.enfant[index]
--
GitLab