repositories
/
Algorithmic_C.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
TP5: fix the iterative search function in linked list
[Algorithmic_C.git]
/
TP2
/
exo1
/
exo1.c
diff --git
a/TP2/exo1/exo1.c
b/TP2/exo1/exo1.c
index 27ff6b997cac7b421d1469885d74ac7378acef2d..514f794c86b56a53ef381413b161173ff5875aff 100644
(file)
--- a/
TP2/exo1/exo1.c
+++ b/
TP2/exo1/exo1.c
@@
-1,6
+1,6
@@
#include <stdio.h>
#include <stdio.h>
-void permuter
(int T[], int n
, int i1, int i2) {
+void permuter
(int T[]
, int i1, int i2) {
int tmp = T[i1];
T[i1] = T[i2];
T[i2] = tmp;
int tmp = T[i1];
T[i1] = T[i2];
T[i2] = tmp;
@@
-20,14
+20,14
@@
void SelecEch(int T[], int n) {
int imin, d = 0;
while (d < n-1) {
imin = i_min(T, n, d);
int imin, d = 0;
while (d < n-1) {
imin = i_min(T, n, d);
- permuter(T,
n,
d, imin);
+ permuter(T, d, imin);
d++;
}
}
void AfficheTab(int T[], int n) {
for (int i = 0; i < n; i++) {
d++;
}
}
void AfficheTab(int T[], int n) {
for (int i = 0; i < n; i++) {
- printf("
valeur a index=%d
=%d\n", i, T[i]);
+ printf("
T[%d]
=%d\n", i, T[i]);
}
}
}
}