Question

Please help with this SML problem.​​​​​​​

4. Write recursive functions for the following: (a) Given an integer i and a list L, cycle L i times. That is, if, L = [a1, A2, ... , an], then the desired result is [di+1, Q i+2, ... , An, Q1, Q2, ... , ai] (b) Compute x', where x is a real and i is a nonnegative integer. This function takes two parameters, x and i.

Answer 1

4 (a) Screenshot:

********************************************** *definition of the recursive function cycle *It takes an integer i and a list L. *It cycles the list L for i number of time. ******************************************* fun cycle L i = if i = 0 then L else (cycle (t1 L) (i-1)) @ [hd(L)];

Code to copy:

(*******************************************

*definition of the recursive function cycle

*It takes an integer i and a list L.

*It cycles the list L for i number of time.

*******************************************)

fun cycle L i =

    if i = 0 then

      L

    else

      (cycle (t1 L) (i-1)) @ [hd(L)];

4 (b) Screenshot:

*************** ************************************ *definition of the recursive function power *It takes real value x and nonnegative integer i. *It computes x^i using recursion. ************************************************ fun power(x,0) = 1 | power(x, i) = power(x,i-1) *x;

Code to copy:

(************************************************

*definition of the recursive function power

*It takes real value x and nonnegative integer i.

*It computes x^i using recursion.

************************************************)

fun power(x,0) = 1 | power(x,i) = power(x,i-1)*x;