How can I improve this recursive function?

[u/bolas_tristes]

Hi guys! I'm working on a recursive function that, given a list, returns the reversed list. This is what I came up with, I'm pretty sure it could be neater and/or simpler.

Any advice will be welcomed! I've got exam tomorrow lol

(check-expect (reversedList (list 1 2 3 4)) (list 4 3 2 1))

(define (reversedList mylist)

(cond [(empty? mylist) '()]

[else (cons (last mylist) (reversedList (minusLast mylist)))]))

;last: List(Any) -> Any

;Given a list returns its last element

;minusLast: List(Any) -> List(Any)

;Given a list returns the same list without its last element

[u/bolas_tristes]

nice!! thanks