Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Mastering JavaScript Functional Programming
  • Table Of Contents Toc
  • Feedback & Rating feedback
Mastering JavaScript Functional Programming

Mastering JavaScript Functional Programming

By : Federico Kereki
4.6 (7)
close
close
Mastering JavaScript Functional Programming

Mastering JavaScript Functional Programming

4.6 (7)
By: Federico Kereki

Overview of this book

Functional programming is a programming paradigm for developing software using functions. Learning to use functional programming is a good way to write more concise code, with greater concurrency and performance. The JavaScript language is particularly suited to functional programming. This book provides comprehensive coverage of the major topics in functional programming with JavaScript to produce shorter, clearer, and testable programs. You’ll delve into functional programming; including writing and testing pure functions, reducing side-effects, and other features to make your applications functional in nature. Specifically, we’ll explore techniques to simplify coding, apply recursion for loopless coding, learn ways to achieve immutability, implement design patterns, and work with data types. By the end of this book, you’ll have developed the JavaScript skills you need to program functional applications with confidence.
Table of Contents (15 chapters)
close
close
8
Connecting Functions - Pipelining and Composition
13
Bibliography
14
Answers to Questions

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 as 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 may opt to take 1 or 2 steps. In how many different ways can you climb up that ladder? As an example, you may climb a four steps 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 again one
  • Taking one step first, then two, and then one
  • Taking one step first, then another one, and finishing with two

9.3. Longest common subsequence...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech

Create a Note

Modal Close icon
You need to login to use this feature.
notes
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Delete Note

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Edit Note

Modal Close icon
Write a note (max 255 characters)
Cancel
Update Note

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY