1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
|
#include <stdio.h>
#include <stdlib.h>
#define MAX 1
#define PAS 10
typedef struct
{
float gain;
float mise;
float vi1;
float vi2;
float vi3;
}ISSUE;
void calculer( float c1, float c2, float c3, ISSUE **issue1, int *t_issue1, ISSUE **issue2, int *t_issue2, ISSUE **issue3, int *t_issue3 );
void affichage( ISSUE *issue, int *t_issue );
void enregistrer( char *chemin, ISSUE *issue, int *t_issue );
void tri_a_bulle(ISSUE *issue, int *t_issue);
int main()
{
/* Valeur des côtes par issue */
float c1 = 2.15;
float c2 = 3.0;
float c3 = 3.30;
/* Structure pour sauvegarder les résultats */
ISSUE *issue1 = NULL;
ISSUE *issue2 = NULL;
ISSUE *issue3 = NULL;
/* Taille des structures */
int *t_issue1 = (int *)malloc(sizeof(int));
int *t_issue2 = (int *)malloc(sizeof(int));
int *t_issue3 = (int *)malloc(sizeof(int));
/* Lancement de la simulation */
calculer( c1, c2, c3, &issue1, t_issue1, &issue2, t_issue2, &issue3, t_issue3 );
/* On tri les données */
printf("\n > Tri des données");
tri_a_bulle(issue1, t_issue1);
tri_a_bulle(issue2, t_issue2);
tri_a_bulle(issue3, t_issue3);
/* On enregistre les données triées */
printf("\n > Sauvegarde des données");
enregistrer( "issue1.txt", issue1, t_issue1 );
enregistrer( "issue2.txt", issue2, t_issue2 );
enregistrer( "issue3.txt", issue3, t_issue3 );
/*Affichage des résultats */
// affichage( issue1, t_issue1 );
// affichage( issue2, t_issue2 );
// affichage( issue3, t_issue3 );
/* Libération des ressources allouées */
free(issue1);
free(issue2);
free(issue3);
free(t_issue1);
free(t_issue2);
free(t_issue3);
return 0;
}
void calculer( float c1, float c2, float c3, ISSUE **issue1, int *t_issue1, ISSUE **issue2, int *t_issue2, ISSUE **issue3, int *t_issue3 )
{
*issue1 = NULL;
*issue2 = NULL;
*issue3 = NULL;
*t_issue1 = 0;
*t_issue2 = 0;
*t_issue3 = 0;
/* Variable pour tester le retour de realloc */
ISSUE *v_realloc1 = NULL;
ISSUE *v_realloc2 = NULL;
ISSUE *v_realloc3 = NULL;
/* Compteur pour connaitre l'état de la progression */
int compteur = 0;
float fin_compteur = MAX*MAX*MAX*PAS*PAS*PAS;
float affichage=0;
int i, j, k;
for ( i=1 ; i<=MAX*PAS ; i++ )
{
for ( j=1 ; j<=MAX*PAS ; j++ )
{
for ( k=1 ; k<=MAX*PAS ; k++ )
{
if ( (float)compteur/fin_compteur >= affichage )
{
system("cls");
printf("\n progression : %.0f%%", (float)100*compteur/fin_compteur);
affichage+=0.01;
}
float g1 = (float)( i*c1 -j -k )/PAS;
float g2 = (float)( -i +j*c2 -k )/PAS;
float g3 = (float)( -i -j +k*c3 )/PAS;
float mise = (float)( i +j +k )/PAS;
if ( g1 > 0 )
{
v_realloc1 = (ISSUE *)realloc( v_realloc1, (*t_issue1+1)*sizeof(ISSUE) );
if ( v_realloc1 != NULL )
{
*issue1 = v_realloc1;
(*issue1)[*t_issue1].gain = g1;
(*issue1)[*t_issue1].mise = mise;
(*issue1)[*t_issue1].vi1 = (float)i/PAS;
(*issue1)[*t_issue1].vi2 = (float)j/PAS;
(*issue1)[*t_issue1].vi3 = (float)k/PAS;
*t_issue1+=1;
}
else perror("\n\n Calculer ");
}
if ( g2 > 0 )
{
v_realloc2 = (ISSUE *)realloc( v_realloc2, (*t_issue2+1)*sizeof(ISSUE) );
if ( v_realloc2 != NULL )
{
*issue2 = v_realloc2;
(*issue2)[*t_issue2].gain = g2;
(*issue2)[*t_issue2].mise = mise;
(*issue2)[*t_issue2].vi1 = (float)i/PAS;
(*issue2)[*t_issue2].vi2 = (float)j/PAS;
(*issue2)[*t_issue2].vi3 = (float)k/PAS;
*t_issue2+=1;
}
else perror("\n\n Calculer ");
}
if ( g3 > 0 )
{
v_realloc3 = (ISSUE *)realloc( v_realloc3, (*t_issue3+1)*sizeof(ISSUE) );
if ( v_realloc3 != NULL )
{
*issue3 = v_realloc3;
(*issue3)[*t_issue3].gain = g3;
(*issue3)[*t_issue3].mise = mise;
(*issue3)[*t_issue3].vi1 = (float)i/PAS;
(*issue3)[*t_issue3].vi2 = (float)j/PAS;
(*issue3)[*t_issue3].vi3 = (float)k/PAS;
*t_issue3+=1;
}
else perror("\n\n Calculer ");
}
compteur++;
}
}
}
}
void affichage( ISSUE *issue, int *t_issue )
{
printf("1");
int i;
for ( i=0 ; i<*t_issue ; i++ )
{
printf("\n CAS n°%d", i);
printf("\n + gain = %f", issue[i].gain );
printf("\n + mise = %f", issue[i].mise );
printf("\n + vi1 = %f", issue[i].vi1 );
printf("\n + vi2 = %f", issue[i].vi2 );
printf("\n + vi3 = %f", issue[i].vi3 );
}
}
void enregistrer( char *chemin, ISSUE *issue, int *t_issue )
{
FILE *fichier = fopen( chemin, "w");
if ( fichier != NULL )
{
int i;
for ( i=0 ; i<*t_issue ; i++ )
{
printf("\n %d/%d", i, *t_issue);
fprintf(fichier, "\n CAS 1", i);
fprintf(fichier, "\n + gain = %f", issue[i].gain );
fprintf(fichier, "\n + mise = %f", issue[i].mise );
fprintf(fichier, "\n + vi1 = %f", issue[i].vi1 );
fprintf(fichier, "\n + vi2 = %f", issue[i].vi2 );
fprintf(fichier, "\n + vi3 = %f", issue[i].vi3 );
}
}
else perror("\n\n enregistrer ");
fclose(fichier);
}
void tri_a_bulle(ISSUE *issue, int *t_issue)
{
int j = 0; /* Variable de boucle */
ISSUE *tmp = (ISSUE *)malloc(1*sizeof(ISSUE));
/* Booléen marquant l'arrêt du tri si le tableau est ordonné */
int en_desordre = 1;
/* Boucle de répétition du tri et le test qui
arrête le tri dès que le tableau est ordonné(en_desordre=FALSE) */
while(en_desordre)
{
/* Supposons le tableau ordonné */
en_desordre = 0;
/* Vérification des éléments des places j et j+1 */
for(j = 0 ; j < *t_issue ; j++)
{
/* Si les 2 éléments sont mal triés */
if(issue[j].gain > issue[j+1].gain)
{
/* Inversion des 2 éléments */
tmp[0].gain = issue[j+1].gain;
tmp[0].mise = issue[j+1].mise;
tmp[0].vi1 = issue[j+1].vi1 ;
tmp[0].vi2 = issue[j+1].vi2 ;
tmp[0].vi3 = issue[j+1].vi3 ;
issue[j+1].gain = issue[j].gain;
issue[j+1].mise = issue[j].mise;
issue[j+1].vi1 = issue[j].vi1 ;
issue[j+1].vi2 = issue[j].vi2 ;
issue[j+1].vi3 = issue[j].vi3 ;
issue[j].gain = tmp[0].gain;
issue[j].mise = tmp[0].gain;
issue[j].vi1 = tmp[0].vi1;
issue[j].vi2 = tmp[0].vi2;
issue[j].vi3 = tmp[0].vi3;
/* Le tableau n'est toujours pas trié */
en_desordre = 1;
}
printf("\n %d/%d", j, *t_issue );
}
}
} |
Tri sur une structure
Répondre avec citation
Partager