Fibonacci sequence
The Fibonacci sequence is a sequence in which each term after the first two is the sum of its two predecessors, with initial terms conventionally 0 and 1 or 1 and 1.
Modern C, Third Edition
The Fibonacci sequence is an integer sequence in which each term after the initial terms is the sum of the preceding two terms.
- How it is used
- Uses Fibonacci numbers to demonstrate recursive definitions, call trees, growth, and repeated computation.
- How deep it goes
- Defines the recurrence, traces fib(4), derives exponential cost, and shows cache-based and two-value recursive alternatives.
- Examples
- Uses the terms 1, 1, 2, 3, 5, 8, the fib(4) call tree, and several C implementations.
- What you can do after
- Build it from scratch as a recursive C function and improve its repeated-work behavior with caching or a two-value buffer.
Read how Modern C, Third Edition explains Fibonacci sequence →
Modern C
The Fibonacci sequence is the integer sequence in which each term after the first two is the sum of the preceding two terms.
- How it is used
- Uses Fibonacci numbers as a concrete example of recursive definitions, call trees, and execution-time growth.
- How deep it goes
- Defines the recurrence, traces fib(4), counts leaf calls, and contrasts direct recursion with caching and reduced state.
- Examples
- Demonstrates the sequence values, a C fib function, the fib(4) call tree, leaf-call counting, and cached computation.
- What you can do after
- Builds Fibonacci computation in C and diagnose why direct recursion becomes slow.
Classic Computer Science Problems in Swift: Essential techniques for practicing programmers
The sequence of integers in which each term is the sum of the two preceding terms, typically starting with 0 and 1.
- How it is used
- Uses a familiar sequence to introduce recursion, base cases, memoization, iteration, and implementation testing.
- How deep it goes
- Works from definition through recursive failure, call tracing, memoization, iteration, and comparative correctness and performance tests.
- Examples
- Uses the sequence values, recursive call tree, Swift fib1 through fib4 functions, and comparative implementation tests.
- What you can do after
- Builds and tests recursive, memoized, and iterative Swift functions for retrieving Fibonacci elements.
Regular Expression Puzzles and AI Coding Assistants
The Fibonacci sequence is the numeric sequence in which each term is the sum of the two preceding terms, conventionally beginning with 1 and 1.
- How it is used
- Frames the Fibonacci relationship as a demanding regular-expression matching problem.
- How deep it goes
- Defines the recursive rule and encoded test problem, then stops short of presenting a verified regular-expression solution.
- Examples
- Uses 1, 1, 2, 3, 5, 8 and @-encoded Fibonacci, Lucas, and incorrect strings as test cases.
- What you can do after
- Evaluate regular expressions by testing their apparent logic against valid prefixes, generalizations, and counterexamples.
Read how Regular Expression Puzzles and AI Coding Assistants explains Fibonacci sequence →
Lead Developer Career Guide
A mathematical sequence in which each term is formed from the preceding terms and whose increasing gaps provide scale values for relative estimation.
- How it is used
- Uses Fibonacci values to estimate relative story-point effort in agile project management.
- How deep it goes
- Defines relative effort and contrasts estimation methods, but does not develop the sequence mathematically.
- Examples
- Uses search-feature tasks scored from 1 to 5, ranging from an empty page framework to search filters.
- What you can do after
- Apply it via story-point estimation to compare task effort and revise estimates during a project.
Read how Lead Developer Career Guide explains Fibonacci sequence →
Building Quantum Software with Python
The Fibonacci sequence is the sequence whose successive terms are formed by adding the two preceding terms, conventionally starting with 0 and 1.
- How it is used
- Uses Fibonacci counting to characterize quantum outcomes without consecutive 1s and motivate oracle-based outcome selection.
- How deep it goes
- Explains the recurrence, works through three-bit outcomes, implements recursion, and connects consecutive-term ratios to the golden ratio.
- Examples
- Uses valid three-bit strings, a recursive Python function, the first ten values, and quantum states for one, two, and three qubits.
- What you can do after
- Builds a recursive Fibonacci calculator and recognizes Fibonacci counts in constrained binary-outcome problems.
Read how Building Quantum Software with Python explains Fibonacci sequence →
Related concepts
- story pointused by · A story point is an abstract relative unit for estimating the size or effort of a software work item, independent of elapsed time.
- recursionproduced by · Recursion is a computational technique in which a definition or procedure refers to or invokes the same definition or procedure, directly or indirectly.
- loopaddressed by · A loop is a programming control-flow construct that repeatedly executes a block of instructions according to an iteration rule or continuation condition.
- code executionproduced by · Code execution is the process of running program instructions or computational operations in a computing environment.
- token idkind of · A token ID is a numeric identifier assigned to a token in a vocabulary so it can be represented and processed numerically.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.