i am also working reverse a list site. i want to share this on my site i hope this is really helpful acacia wood comparison.

Elixir solution using recursion https://gist.github.com/uxjp/89ec7ff027ebcf942f3ef09ac149885b

rev=reverse

Haskell:

rev [] = []
rev (x:xs) = rev xs ++ [x]

Inverting index to get element position i :

rev' l = [ l !! (i-1) | i <- [length l, length l - 1 .. 1]]	

Haskell, rev l = reverse l