Fibonacci Sequence in R Programming
The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones, starting from 0 and 1. In R programming, we can explore this sequence using different approaches:
- Loops: We can iterate through the sequence, calculating and storing each new term based on the previous ones.
- Recursion: We can define a function that calls itself with the previous two terms as arguments, calculating the next term in the sequence.
- Vectorized operations: We can utilize R’s built-in functions and vectorized operations to efficiently create the sequence in one go.
Program Input:
nterms = as.integer(readline(prompt="How many terms? ")) # first two terms n1 = 0 n2 = 1 count = 2 # check if the number of terms is valid if(nterms <= 0) { print("Plese enter a positive integer") } else { if(nterms == 1) { print("Fibonacci sequence:") print(n1) } else { print("Fibonacci sequence:") print(n1) print(n2) while(count < nterms) { nth = n1 + n2 print(nth) # update values n1 = n2 n2 = nth count = count + 1 } } }
Out put:
How many terms? 6 [1] "Fibonacci sequence:" [1] 0 [1] 1 [1] 1 [1] 2 [1] 3 [1] 5