Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
C
cours
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
algorithmique
cours
Commits
44f56a10
Verified
Commit
44f56a10
authored
3 years ago
by
orestis.malaspin
Browse files
Options
Downloads
Plain Diff
Merge branch 'master' of
ssh://ssh.hesge.ch:10572/algorithmique/cours
parents
a2c8decf
0a44c1f1
No related branches found
No related tags found
No related merge requests found
Pipeline
#15240
passed
3 years ago
Stage: test
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
slides/cours_14.md
+19
-10
19 additions, 10 deletions
slides/cours_14.md
with
19 additions
and
10 deletions
slides/cours_14.md
+
19
−
10
View file @
44f56a10
...
...
@@ -39,17 +39,22 @@ $$
# Préambule
\s
mall
*
On considère pas le cas du chaînage en cas de collisions.
*
L'insertion est construite avec une forme du type
```C
index = h(key);
while (table[index].state == OCCUPIED && table[index].key != key) {
while (table[index].state == OCCUPIED
&& table[index].key != key) {
index = (index + k) % table_size; // attention à pas dépasser
}
table[index].key = key;
table[index].state = OCCUPIED;
```
\n
ormalsize
*
Gestion de l'état d'une case
*explicite*
```C
...
...
@@ -65,11 +70,13 @@ $$
```
C
insert(table, key, value) {
index = hash de la clé;
index = si "index" est déjà occupé et la clé correspondante est pas "key"
gérer la collision;
index =
si "index" est déjà "occupé"
et la clé correspondante n'est pas "key"
alors gérer la collision;
changer l'état de la case
à
"index" à occupé;
changer la valeur de la case "index" à value;
changer l'état de la case "index" à
"
occupé
"
;
changer la valeur de la case "index" à
"
value
"
;
}
```
...
...
@@ -82,9 +89,9 @@ insert(table, key, value) {
```
C
value_t remove(table, key) {
index = hash de la clé;
tant que l'état de la case est pas "vide"
si "index" est occupé et la clé est "key"
changer l'état de la case à supprimé
tant que l'état de la case
n'
est pas "vide"
si "index" est
"
occupé
"
et la clé est "key"
changer l'état de la case à
"
supprimé
"
sinon
index = rehash
}
...
...
@@ -99,8 +106,8 @@ value_t remove(table, key) {
```
C
bool search(table, key, value) {
index = hash de la clé;
tant que l'état de la case est pas "vide"
si "index" est occupé et la clé est "key"
tant que l'état de la case
n'
est pas "vide"
si "index" est
"
occupé
"
et la clé est "key"
retourner vrai
sinon
index = rehash
...
...
@@ -118,6 +125,8 @@ bool search(table, key, value) {
## Structures de données
\f
ootnotesize
. . .
```
C
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment