Book Image

Learning C++ Functional Programming

By : Wisnu Anggoro
5 (1)
Book Image

Learning C++ Functional Programming

5 (1)
By: Wisnu Anggoro

Overview of this book

Functional programming allows developers to divide programs into smaller, reusable components that ease the creation, testing, and maintenance of software as a whole. Combined with the power of C++, you can develop robust and scalable applications that fulfill modern day software requirements. This book will help you discover all the C++ 17 features that can be applied to build software in a functional way. The book is divided into three modules—the first introduces the fundamentals of functional programming and how it is supported by modern C++. The second module explains how to efficiently implement C++ features such as pure functions and immutable states to build robust applications. The last module describes how to achieve concurrency and apply design patterns to enhance your application’s performance. Here, you will also learn to optimize code using metaprogramming in a functional way. By the end of the book, you will be familiar with the functional approach of programming and will be able to use these techniques on a daily basis.
Table of Contents (15 chapters)
Title Page
Credits
About the Author
About the Reviewer
www.PacktPub.com
Customer Feedback
Preface

Getting acquainted with functional, procedural, and backtracking recursion


So now that we have understood a little about recursion, the recursion function will call itself from inside its body. The recursion will be stopped only when it has reached a certain value. There are three types of recursion that we will discuss right away--functional recursion, procedural recursion, and backtracking recursion; however, these three types of recursion may not be standard terms. Functional recursion is a recursion process that returns some value. Procedural recursion is a recursion process that doesn't return a value, yet performs the action in each recursion it takes. Backtracking recursion is a recursion process to break down the task into a small set of subtasks that can be cancelled if they don't work. Let's consider these recursion types in the following discussion.

Expecting results from functional recursion

In functional recursion, the process tries to solve the problem by combining the results...