TDA/Sequences.c at complexity · CesarAng28/TDA · GitHub

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
<<<<<<< HEAD
//
//  Sequences.c
//
//
//  Created by Cesar Angeles on 07/09/2020.
//

#include <stdio.h>
#include <stdlib.h>

#define Sequences_IMPORT
#include "Sequences.h"


long long int Sequences_sfibo(long long int n){
    long long int sequence_1 = 0, sequence_2 = 1, temp = 0;
    int index = 0;

    for (index = 0; index < n; index ++){

        temp = sequence_2;
        sequence_2 = sequence_2 + sequence_1;
        sequence_1 = temp;

    }
    (n<=0) ? sequence_2 = 0 : (sequence_2 = sequence_1);

    return sequence_2;

}


long long int Sequences_rfibo(long long int n){

    if (n == 1){
        return 1;
    }
    if(n > 1){
        return Sequences_rfibo(n - 1) + Sequences_rfibo(n - 2);
    }else{
        return 0;
    }

}
||||||| f46ea0f
=======
//
//  Sequences.h
//
//
//  Created by Cesar Angeles on 07/09/2020.
//

#ifndef Sequences_h
#define Sequences_h

#include <stdio.h>

#ifdef Sequences_IMPORT
    #define EXTERN
#else
    #define EXTERN extern
#endif


/* Sequences.h -- Function prototypes */

/**
 * Returns the value of the fibonacci sequence at index n calculated sequentially
 * @param
 *      n (long long int):
 *          Index of the fibonacci sequence
 * @return long long int value
*/

/*long long int Sequences_sfibo(long long int n) {
    int prev_number = 0, next_number = 1;
    n = prev_number;
    prev_number = next_number;
    next_number = next_number + n;
    return n;
}*/

long long int Sequences_sfibo(long long int n){
    long long int prev_number = 0, next_number = 1, fibonacci_number = 0;
    int index = 0;

    for (index = 0; index < n; index ++){
        fibonacci_number = prev_number;
        prev_number = next_number;
        next_number = next_number + fibonacci_number;
        return fibonacci_number;
    }

}


/**
 * Returns the value of the fibonacci sequence at index n calculated recursively
 * @param
 *      n (long long int):
 *          Index of the fibonacci sequence
 * @return long long int value
*/

/*long long int Sequences_rfibo(long long int n) {
    if(n == 0) {
        return 0;
    }
    else if(n == 1) {
        return 1;
    }
    else {
        return(recursive_fib(n - 1) + recursive_fib(n - 2));
    }
}*/

long long int Sequences_rfibo(long long int number){
    if (number == 0){
        return 0;
    }
    else if(number == 1){
        return 1;
    }
    else{
        return Sequences_rfibo(number - 1) + Sequences_rfibo(number - 2);
    }
}


#undef Sequences_IMPORT
#undef EXTERN
#endif /* Sequences_h */
>>>>>>> e94102e9b652f269c770d77c8267559b161b52fd