Skip to content
Snippets Groups Projects
Verified Commit 86d4582e authored by orestis.malaspin's avatar orestis.malaspin
Browse files

corrected +

parent b7a82223
Branches
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
Showing
with 2 additions and 2 deletions
slides/cours_21.md
+ 2
− 2
View file @ 86d4582e
...@@ -373,8 +373,8 @@ int depth(node *qt) { ...@@ -373,8 +373,8 @@ int depth(node *qt) {
noeud position(li, co, arbre) noeud position(li, co, arbre)
d = profondeur(arbre); d = profondeur(arbre);
tant_que (d >= 1) tant_que (d >= 1)
index = 2 * ((li % 2^d) / 2^(d-1)) + index = 2 * ((li % 2^d) / 2^(d-1))
(col % 2^d) / 2^(d-1) + (col % 2^d) / 2^(d-1)
arbre = arbre.enfant[index] arbre = arbre.enfant[index]
d -= 1 d -= 1
retourne arbre retourne arbre
......
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment