Choose a function, Fibonacci (f) or Collatz (c) [otherwise quit]: f Enter lower and upper bounds (two integers): 0 30 Recursive ver. Looped ver. n result steps time result steps time --- --------------------------- --------------------------- 0 0 1 23000 0 0 1000 1 1 1 2000 1 1 19000 2 1 3 12000 1 2 3000 3 2 5 3000 2 3 2000 4 3 9 5000 3 4 3000 5 5 15 7000 5 5 2000 6 8 25 11000 8 6 3000 7 13 41 15000 13 7 2000 8 21 67 14000 21 8 2000 9 34 109 34000 34 9 3000 10 55 177 98000 55 10 5000 11 89 287 138000 89 11 6000 12 144 465 142000 144 12 4000 13 233 753 159000 233 13 3000 14 377 1219 354000 377 14 4000 15 610 1973 764000 610 15 8000 16 987 3193 1028000 987 16 6000 17 1597 5167 1780000 1597 17 4000 18 2584 8361 1241000 2584 18 3000 19 4181 13529 1879000 4181 19 3000 20 6765 21891 175000 6765 20 4000 21 10946 35421 313000 10946 21 6000 22 17711 57313 267000 17711 22 3000 23 28657 92735 593000 28657 23 5000 24 46368 150049 866000 46368 24 5000 25 75025 242785 1231000 75025 25 4000 26 121393 392835 1736000 121393 26 4000 27 196418 635621 2182000 196418 27 5000 28 317811 1028457 4174000 317811 28 7000 29 514229 1664079 5584000 514229 29 5000 30 832040 2692537 10779000 832040 30 6000