CodingBat fibIter

fibIter

A recursive method of Fibonacci that uses tail recursion. You may not call the recursion more than once. When f1 and f2 are 1 and 0 the output of fibIter(n,f1,f2) will be the nth Fibonacci number such that 0:1, 1:1, etc.

fibIter(0, 1, 0) → 0
fibIter(1, 1, 0) → 1
fibIter(2, 1, 0) → 1

...Save, Compile, Run (ctrl-enter)

Forget It! -- delete my code for this problem

Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph

Java Help

Java Example Solution Code
Java String Introduction (video)
Java Substring v2 (video)
Java String Equals and Loops
Java String indexOf and Parsing
Java If and Boolean Logic
If Boolean Logic Example Solution Code 1 (video)
If Boolean Logic Example Solution Code 2 (video)
Java For and While Loops
Java Arrays and Loops
Java Map Introduction
Java Map WordCount
Java Functional Mapping
Java Functional Filtering

Misc Code Practice

Code Badges
Introduction to Mod (video)
MakeBricks problem and solution (video x 2)
FizzBuzz the famous code interview question (video)

id/email
password

forgot password \| create account