Académique Documents
Professionnel Documents
Culture Documents
Section : INFO-1
Enseignante : Fehima Achour
Matière : Algorithmique et programmation C
/***File.h***/
struct element{
int cle;
struct element *suivant;
};
struct file {
struct element * tete;
struct element * queue;
};
void creer_file (struct file *);
unsigned file_vide (struct file);
int premier (struct file);
void enfiler (int, struct file *);
void defiler (struct file *) ;
/***File.c***/
#include <assert.h>
#include <stdlib.h>
#include "file.h"
/***Test.c***/
#include<stdio.h>
#include"file.h"
void main() {
unsigned i;
struct file f1;
struct file f2;
creer_file(&f1);
creer_file(&f2);
for(i=1;i<=10;i++)
enfiler(i,&f1);
for(i=11;i<=20;i++)
enfiler(i,&f2);
for(i=1;i<=10;i++) {
printf("%d \t %d \n",premier(f1), premier(f2));
defiler(&f1);
defiler(&f2);
}
if (file_vide(f1)&&file_vide(f2))
printf("c'est bon les deux files sont vides..");
else
printf("probleme");
}