a) Given the following non-tail recursive function for determining whether a given number is even or not: (ns core-clj.core (:gen-class)) (defn even-num? [n] (if (= n 0) true (not (even-num? (dec n))))) (defn -main [] (println) (even-num? 8))) Rewrite the above clojure function (even-num?) so it can enforce the TCO condition: (b) Use the built-in higher ordered functions like (filter, map, take or reduce) to filter out the first three even numbers in given list like (4 7 9 6 19 8 21). Note: you need to call the even-num? function given in (a).

a) Given the following non-tail recursive function for determining whether a given number is even or not: (ns core-clj.core (:gen-class)) (defn even-num? [n] (if (= n 0) true (not (even-num? (dec n))))) (defn -main [] (println) (even-num? 8))) Rewrite the above clojure function (even-num?) so it can enforce the TCO condition: (b) Use the built-in higher ordered functions like (filter, map, take or reduce) to filter out the first three even numbers in given list like (4 7 9 6 19 8 21). Note: you need to call the even-num? function given in (a).

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 7SA

See similar textbooks