Fibonacci Number
The Fibonacci sequence starts from base values and each next number is the sum of the previous two.
이 멘탈 모델부터 시작하세요
The Fibonacci sequence starts from base values and each next number is the sum of the previous two.
불필요한 전문용어 없이 동작 방식 이해하기
Naive recursion recomputes the same subproblems and grows exponentially.
An iterative solution keeps only the previous two numbers, giving O(n) time and O(1) extra space.
알고리즘을 연속된 의사결정으로 읽기
State the mathematical identity/property.
Choose numeric representation and constraints.
Translate the property into an iterative/recursive computation and analyze precision.
Read a tiny input by hand and write down the state after every important operation. For Fibonacci Number, the goal is to make the invariant visible rather than to memorize code.
function fibonacci(n) {
let a = 0, b = 1;
for (let i = 0; i < n; i++) {
[a, b] = [b, a + b];
}
return a;
}문법을 외우지 마세요. 각 줄에서 바뀌는 상태를 따라가고 위에서 설명한 불변식과 연결하세요.
O(n) iterative / O(2ⁿ) naive recursion
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
적합한 경우
- Use the direct mathematical property when it removes unnecessary brute force.
보통 어디에서 문제가 생기는가
- Ignoring floating-point precision or integer range.
- Using a formula outside its valid assumptions.
전문적인 답변 구조
Use Fibonacci to explain overlapping subproblems, memoization and the difference between elegant-looking recursion and efficient recursion.
What problem does Fibonacci Number solve?
The Fibonacci sequence starts from base values and each next number is the sum of the previous two.
복잡도에 대해 무엇을 언급해야 하나요?
Its typical cost here is O(n) iterative / O(2ⁿ) naive recursion, but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
가장 흔한 실수는 무엇인가요?
Ignoring floating-point precision or integer range.