Nth Fibonacci
Code
Python
- Solution 1
- Solution 2
- Solution 3
def getNthFib(n):
if n == 2:
return 1
elif n == 1:
return 0
else:
return getNthFib(n - 1) + getNthFib(n - 2)
JavaScript
- Solution 1
- Solution 2
- Solution 3
function getNthFib(n) {
if (n === 2) {
return 1;
} else if (n === 1) {
return 0;
} else {
return getNthFib(n - 1) + getNthFib(n - 2);
}
}
exports.getNthFib = getNthFib;
TypeScript
- Solution 1
- Solution 2
- Solution 3
export function getNthFib(n: number): number {
if (n === 2) {
return 1;
} else if (n === 1) {
return 0;
} else {
return getNthFib(n - 1) + getNthFib(n - 2);
}
}
Java
- Solution 1
- Solution 2
- Solution 3
class Program {
public static int getNthFib(int n) {
if (n == 2) {
return 1;
} else if (n == 1) {
return 0;
} else {
return getNthFib(n - 1) + getNthFib(n - 2);
}
}
}
C++
- Solution 1
- Solution 2
- Solution 3
using namespace std;
int getNthFib(int n) {
if (n == 2) {
return 1;
} else if (n == 1) {
return 0;
} else {
return getNthFib(n - 1) + getNthFib(n - 2);
}
}
Space-Time Complexity
- Solution 1
- Solution 2
- Solution 3
| Time | Space | |
|---|---|---|
| Worse | O(2n) | O(n) |
Where n is the input number