Fibonacci
12345678910111213141516171819202122
fun findFibonacciIterative(number : Int) : Int {
var arr = arrayListOf<Int>()
arr.add(0)
arr.add(1)
for(i in 2..number) {
arr.add(arr[i-2] + arr[i-1])
}
return arr[number]
}
fun findFibonacciRecursive(number: Int) : Int {
if(number < 2) {
return number
}
return findFibonacciRecursive(number - 2) + findFibonacciRecursive(number - 1)
}
fun main(args : Array<String>){
println(findFibonacciIterative(40).toString())
println(findFibonacciRecursive(40).toString())
}
Kotlin
INFO