Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering JavaScript Functional Programming

You're reading from   Mastering JavaScript Functional Programming Write clean, robust, and maintainable web and server code using functional JavaScript

Arrow left icon
Product type Paperback
Published in Jan 2020
Publisher Packt
ISBN-13 9781839213069
Length 470 pages
Edition 2nd Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Federico Kereki Federico Kereki
Author Profile Icon Federico Kereki
Federico Kereki
Arrow right icon
View More author details
Toc

Table of Contents (17) Chapters Close

Preface 1. Technical Requirements
2. Becoming Functional - Several Questions FREE CHAPTER 3. Thinking Functionally - A First Example 4. Starting Out with Functions - A Core Concept 5. Behaving Properly - Pure Functions 6. Programming Declaratively - A Better Style 7. Producing Functions - Higher-Order Functions 8. Transforming Functions - Currying and Partial Application 9. Connecting Functions - Pipelining and Composition 10. Designing Functions - Recursion 11. Ensuring Purity - Immutability 12. Implementing Design Patterns - The Functional Way 13. Building Better Containers - Functional Data Types 14. Bibliography
15. Answers to Questions 16. Other Books You May Enjoy

Questions

9.1. Into reverse: Can you program a reverse() function, but implement it in a recursive fashion? Obviously, the best way to go about this would be using the standard string reverse() method, as detailed in https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reverse, but that wouldn't do for a question on recursion, would it?

9.2. Climbing steps: Suppose you want to climb up a ladder with n steps. At each time you raise your foot, you may opt to climb up one or two rungs. In how many different ways can you climb up that ladder? For example, you can climb a four-rung ladder in five different ways:

  • Always taking one step at a time
  • Always taking two steps at a time
  • Taking two steps first, then one, and then one
  • Taking one step first, then two, and then one
  • Taking one step first, then another one, and finishing with two

9.3...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at €18.99/month. Cancel anytime