Define the function iota1(n, m) that takes positive integers n, m with n < m as input, and outputs the list (n,n+1,n+2,...,m)
I\'ve tried switching the code around mu
Welcome to the racket world, my version is here:
#lang racket (define (iota1 n m) (let loop ([loop_n n] [result_list '()]) (if (<= loop_n m) (loop (add1 loop_n) (cons loop_n result_list)) (reverse result_list))))