Fibonacci
Publicado por Juan José (7 intervenciones) el 28/10/2019 19:41:05
Ayuda para solucionar los problemas
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
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
void rfib(int *fib, int x, int *last);
int main (int argc, char *argv[])
{ int N,x; int *s;char *str, *str2;
N = atoi(argv[1]);
s[0]=0;
s[1]=1;
s = malloc(sizeof(int)*N);
if (s=NULL)
exit(1);
// Calculate Fibonacci Serie.
for (x=0;x<=N;x++)
s[x] = s[x-1] + s[x-2];
// Print Fibonacci Serie.
str2="Iterative Fibonacci Calculation";
for (x=0;x<=N;x++)
{sprintf(str,"%s %d: %d\n",str2, x, s[x]);
write(1,str,strlen(str));
}rfib(s,0,0);
// Print Fibonacci Serie.
strcpy(str2,"Recursive Fibonacci calculation");
for (x=0;x<=N;x++)
{sprintf(str,"%s %d: %d\n", str2, x);
write(1,str,strlen(str));
}exit(0);
}void rfib(int *fib, int x, int *last)
{if (x==0)
*fib=0;
else
if (x==1)
*fib=1;
else if (x>1)
*fib=fib[-1]+fib[-2];
if (fib+1!=last)
rfib(fib++,x++,last);
}Valora esta pregunta
0
