Question: Write a recursive function (string* str n) that takes two arguments: a string x and a non-negative integer n. The non-negative integers are defined inductively

Write a recursive function (string* str n) that takes two arguments: a string x and a non-negative integer n. The non-negative integers are defined inductively as:

  ::= 0 |  + 1 

string* returns a string consisting of n occurrences of str. For example:

 > (string* "Eugene" 3) "EugeneEugeneEugene" 

You will want to use Racket's string-append function. Remember that the base case when recurring on a non-negative integer is 0.

Help for racket

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!