about | help | code help+videos | done | prefs |
Define a tail optimised recursive function that when passed an integer (say n), returns the number of digits of that integer. You may assume n >= 0. count_digits_recursive(1729) → 4 count_digits_recursive(0) → 0 count_digits_recursive(8) → 1 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 1 Post-solution available
Copyright Nick Parlante 2017 - privacy