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
a76b89b9
Verified
Commit
a76b89b9
authored
3 years ago
by
orestis.malaspin
Browse files
Options
Downloads
Patches
Plain Diff
started hash table
parent
af9cdf5b
No related branches found
No related tags found
No related merge requests found
Pipeline
#15142
passed
3 years ago
Stage: test
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
slides/cours_13.md
+76
-0
76 additions, 0 deletions
slides/cours_13.md
with
76 additions
and
0 deletions
slides/cours_13.md
0 → 100644
+
76
−
0
View file @
a76b89b9
---
title: "Tables de hachage"
date: "2022-01-12"
patat:
eval:
tai:
command: fish
fragment: false
replace: true
ccc:
command: fish
fragment: false
replace: true
images:
backend: auto
...
# Tableau vs Table
Structures permettant de stocker une collection d'éléments du même type.
## Tableau
*
Chaque élément (ou valeur) est lié à un indice (la case du tableau).
```
C
annuaire tab[2] = {
"+41 22 123 45 67", "+41 22 234 56 78", ...
};
tab[1] == "+41 22 123 45 67";
```
## Table
*
Chaque élément (ou valeur) est lié à une clé.
```
C
annuaire tab = {
// Clé , Valeur
"Paul", "+41 22 123 45 67",
"Orestis", "+41 22 234 56 78",
};
tab["Paul"] == "+41 22 123 45 67";
tab["Orestis"] == "+41 22 234 56 78";
```
# Table
## Définition
Structure de données abstraite où chaque
*valeur*
(ou élément) est associée à une
*clé*
(ou
argument).
On parle de paires
*clé-valeur*
(
*key-value pairs*
).
## Donnez des exemples de telles paires
. . .
*
Annuaire (nom-téléphone),
*
Catalogue (objet-prix),
*
Table de valeur fonctions (nombre-nombre),
*
Index (nombre-page)
*
...
# Table
## Opérations principales sur les tables
*
Insertion d'élément (
`insert(clé, valeur)`
{.C}), insère la paire
`clé-valeur`
*
Consultation (
`get(clé)`
{.C}), retourne la
`valeur`
correspondant à
`clé`
*
Suppression (
`remove(clé)`
{.C}), supprime la paire
`clé-valeur`
## Structure de données
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