In order for me to understand tail recursion with a sample as simple as possible would anybody put a tail recursion version of the following funcion?
Stacked version of Reverse ( Text ):
Length ( Text ) > 1 ;
Reverse ( Right ( Text ; Length ( Text ) - 1 ) ) & Left ( Text ; 1 ) ;
Thank you very much in advance.