Notes

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define ANSI_COLOR_RED "x1b[31m"
#define ANSI_COLOR_GREEN "x1b[32m"
#define ANSI_COLOR_YELLOW "x1b[33m"
#define ANSI_COLOR_BLUE "x1b[34m"
#define ANSI_COLOR_MAGENTA "x1b[35m"
#define ANSI_COLOR_CYAN "x1b[36m"
#define ANSI_COLOR_RESET "x1b[0m"
/* --------- Declaration --------- */

struct list {
int n;
struct list *svt;
};
/* --------- AFFICHAGE --------- */
void display(struct list *tete){
struct list *tmp = tete;
if (tmp !=NULL)
{
int test=0;
int i;

//printf("------------------------------------------n");
int length =taille(tete);
int z ;
for (z = 1; z <= length; z++)
{
printf("------");
printf(" ");
}
printf("n");
while (test != 1) {
printf("| %d |---> ",tmp -> n);
if (tmp -> svt == NULL)
{
test = 1;
}
tmp = tmp -> svt;
}
printf("END :) n");
for (z = 1; z <= length; z++)
{
printf("------");
printf(" ");
}
printf("n");
} else {
printf("Chaine Vide XD n");
}
}
/* --------- TAILLE --------- */
int taille(struct list *tete){
struct list *tmp = tete;
int i =0;
if (tmp !=NULL)
{
int test=0;
while (test != 1) {
if (tmp -> svt == NULL)
test = 1;
i++;
tmp = tmp -> svt;
}
} else {
i=0;
}
//printf("proc length %dn", i);
return i;
}
/* --------- Q1 --------- */
struct list *addbegin(struct list *tete , int n){
struct list *nouv = malloc(sizeof(struct list));
if ( nouv != NULL){
nouv -> n = n;
nouv -> svt = NULL;
if (tete == NULL) {
tete = nouv;
} else {
nouv -> svt = tete;
tete = nouv;
}
}
//display(tete);
return(tete);
}

struct list *addend(struct list *tete , int n){
struct list *nouv = malloc(sizeof(struct list));
if ( nouv != NULL){
nouv -> n = n;
nouv -> svt = NULL;
if (tete == NULL) {
tete = nouv;
} else {
struct list *tmp = tete ;
while(tmp -> svt != NULL )
tmp = tmp -> svt;
tmp -> svt = nouv;
}
}
return(tete);
}

struct list *fifo(struct list *tete){
struct list *del = tete;
if ( tete != NULL){
tete = tete -> svt;
free(del);
}
return(tete);
}
struct list *rond_robin(struct list *tete, int q){
struct list *temp = tete;
struct list *destroy = tete;
if ( tete != NULL){
int i ;
for (i = 1; i <= q; i++)
{
temp -> n -=1;
if (temp -> n == 0)
{
destroy = temp;

temp = temp -> svt;
tete = temp;
free(destroy);
}
}

}
//display(tete);
return(tete);
}
struct list *SGF(struct list *tete){

if ( tete != NULL){
/* hewes */
struct list *der_cible = NULL;
struct list *cible = tete;

struct list *amount = NULL;
struct list *temp = tete;
while(temp != NULL){

if (cible -> n > temp -> n)
{
cible = temp;
der_cible = amount;
}
amount = temp;
temp= temp -> svt;

}
printf("la valeur min est%dn",cible -> n );
der_cible -> svt = cible -> svt;
free(cible);
}
return(tete);
}
void delay(int i){
clock_t start,end;
start=clock();
while(((end=clock())-start)<=i*CLOCKS_PER_SEC);
}
void main(){

struct list *list_h = NULL;
struct list *list_m = NULL;
struct list *list_l = NULL;

int r,i;
while (1){
for (i = 0; i < 3; ++i)
{
r = (rand()%9)+1;
list_h = addend(list_h,r);
r = (rand()%9)+1;
list_m = addend(list_m,r);
r = (rand()%2)+1;
list_l = addend(list_l,r);
}

// FIFO
display(list_h);
//SGF
display(list_m);
//ROND ROBIN
display(list_l);

printf(ANSI_COLOR_RED"--------------------( FIFO )---------------------n"ANSI_COLOR_RESET);
display(list_h);
list_h = fifo(list_h);
list_h = fifo(list_h);
display(list_h);
printf(ANSI_COLOR_RED"--------------------( SJF )---------------------n"ANSI_COLOR_RESET);
display(list_m);
list_m = SGF(list_m);
list_m = SGF(list_m);
display(list_m);
printf(ANSI_COLOR_RED"--------------------( ROND ROBIN )---------------------n"ANSI_COLOR_RESET);

display(list_l);
list_l = rond_robin(list_l,4);
display(list_l);
delay(3);

}
}