I wanted to give this a try. But Scrubz solution cant be beaten, its nice. But maybe diversity is welcome.
A bad game can still have a good story, so, here is the story of Task 1: I call this "lazy recursion", the code uses recursion, but it just hands over an index, and always the same text variable. So, it does use a lot of memory - maybe you could use this for memory testing (somehow) ;-). By the way I probably introduced a new concept: the measurement of numerics: it answers the question "how numeric is a variable containing text?" (I had no clue how to name this recursive function, because it tests only one char but also sums up all found numeric values).
Task 1
function howNumericIsCharAtIndexAndAfter(index, text) isNumeric = false if index >= len(text) then else c = chrVal(text[index]) if c >= chrVal("0") and c <= chrVal("9") then isNumeric = true endif index += 1 isNumeric += howNumericIsCharAtIndexAndAfter(index, text) endif return isNumeric t = "ab12cd34" print(howNumericIsCharAtIndexAndAfter(0, t))output:
4
