about | help | code help+videos | done | prefs |
Write a RECURSIVE method that returns a string made by combining the numbers from 'lowest' to 'highest' into a string with no spaces between the numbers. Look at the test data for examples. As preconditions you may assume that 'lowest' is less than or equal to 'highest'. You MUST use RECURSION in a meaningful way to solve this problem. buildStringX1(7, 7) → "7" buildStringX1(7, 17) → "7891011121314151617" buildStringX1(9, 20) → "91011121314151617181920" ...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: 310
Copyright Nick Parlante 2017 - privacy