Chapter 5 - Section 5.4 - Recursive Algorithms - Exercises - Page 371: 37

--Recursive algorithm for finding the reversal of a bit string.

--procedure reverse(w: bit string) -n := length(w) -if n ≤ 1 then return w else -return substr(w, n, n)reverse (substr (w, 1, n − 1)) {substr(w, a, b) is the substring of w consisting of the symbols in the ath through bth positions}