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
f0d9ffcc
Verified
Commit
f0d9ffcc
authored
3 years ago
by
orestis.malaspin
Browse files
Options
Downloads
Patches
Plain Diff
added linked list
parent
4733c99c
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Pipeline
#14961
passed
3 years ago
Stage: test
Changes
2
Pipelines
1
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
slides/cours_9.md
+155
-1
155 additions, 1 deletion
slides/cours_9.md
slides/figs/Singly-linked-list.svg
+638
-0
638 additions, 0 deletions
slides/figs/Singly-linked-list.svg
with
793 additions
and
1 deletion
slides/cours_9.md
+
155
−
1
View file @
f0d9ffcc
---
title: "
Backtracking
et
p
iles"
title: "
Piles
et
f
iles
d'attente
"
date: "2021-11-25"
patat:
eval:
...
...
@@ -148,6 +148,10 @@ int stack_peek(stack *s) {
}
```
## Quelle est la complexité de ces opérations?
. . .
## Voyez-vous des problèmes potentiels avec cette implémentation?
. . .
...
...
@@ -502,3 +506,153 @@ char *infix_to_postfix(char* infix) { // init and alloc stack and postfix
return postfix;
}
```
# La liste chaînée et pile (1/N)
## Structure de données
*
Chaque élément de la liste contient:
1.
une valeur,
2.
un pointeur vers le prochain élément.
*
La pile est un pointeur vers le premier élément.

{width=80%}
# La liste chaînée et pile (2/N)
## Une pile-liste-chaînée
```
C
typedef struct _element {
int data;
struct _element *next;
} element;
typedef element* stack;
```
## Fonctionnalités?
. . .
```
C
stack stack_create(); // return NULL;
void stack_destroy(stack *s);
void stack_push(stack *s, int val);
int stack_pop(stack *s);
int stack_peek(stack s);
bool stack_is_empty(stack s); // reutrn NULL == stack;
```
# La liste chaînée et pile (3/N)
## Empiler? (faire un dessin)
. . .
```
C
```
## Empiler? (le code ensemble)
. . .
```
C
void stack_push(stack *s, int val) {
element *elem = malloc(sizeof(*elem));
elem->data = val;
elem->next = *stack;
stack = elem;
}
```
# La liste chaînée et pile (4/N)
## Jeter un oeil? (faire un dessin)
. . .
```
C
```
## Jeter un oeil? (le code ensemble)
. . .
```
C
int stack_peek(stack s) {
return s->data;
}
```
# La liste chaînée et pile (5/N)
## Dépiler? (faire un dessin)
. . .
```
C
```
## Dépiler? (le code ensemble)
. . .
```
C
int stack_pop(stack *s) {
int val = stack_peek(*s);
element *tmp = *s;
*s = (*s)->next;
free(tmp);
return val;
}
```
# La liste chaînée et pile (6/N)
## Détruire? (faire un dessin)
. . .
```
C
```
## Détruire? (le code ensemble)
. . .
```
C
void stack_destroy(stack *s) {
while (!stack_is_empty(*s)) {
int val = stack_pop(s);
}
}
```
This diff is collapsed.
Click to expand it.
slides/figs/Singly-linked-list.svg
0 → 100644
+
638
−
0
View file @
f0d9ffcc
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