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
| #include <stdio.h>
#include <stdlib.h>
/* somme des n premiers termes
en utilisant des indices */
int sum(int tab[], int n)
{
int ret = 0;
int i;
for (i = 0; i < n; ++i) {
ret += tab[i];
}
return ret;
}
/* produit des n premiers termes
en utilisant des pointeurs */
int prod(int *p, int n)
{
int ret = 1;
int *end = p + n;
while (p != end) {
ret *= *p;
p++;
}
return ret;
}
int main(void)
{
int i;
/* tableau statique */
int tab[5] = { 1, 2, 3, 4, 5 };
/* tableau dynamique */
int *p = malloc(5 * sizeof *p);
if (NULL == p) {
perror("malloc");
exit(EXIT_FAILURE);
}
for (i = 0; i < 5; ++i) {
p[i] = i + 1;
}
printf("sum tab: %d\n", sum(tab, 5));
printf("sum p: %d\n", sum(p, 5));
printf("prd tab: %d\n", prod(tab, 5));
printf("prd p: %d\n", prod(p, 5));
free(p);
return EXIT_SUCCESS;
} |
