Question: # Rewrite the following Scheme function as a tail-recursive function. ;; compute integer log, base 2 ;; (number of bits in binary reprepresentation) ;; works
# Rewrite the following Scheme function as a tail-recursive function.
;; compute integer log, base 2 ;; (number of bits in binary reprepresentation) ;; works only for positive integers
(define (log2 n) (if (= n 1) 0 (+ 1 (log2 (quotient (+ n 1) 2)))) )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
