Functional Programming Table of Contents

Table of Content


Why Functional Programming?

  • The Imperative Way and a Higher Level of Abstraction
  • Functional Programming and Boilerplate
  • Higher Order Functions
  • Recursion Aids Immutability
  • Copy-On-Write, Laziness, and Deferred Execution
  • Composing Functions

FP Building Blocks

  • The Big O Notation
  • Space/Time Trade-Off
  • Referential Transparency
  • Vectors Versus Lists
  • Complexities and Collections

Lists in FP

  • First Steps
  • List Head and Tail
  • Drop Elements
  • Concatenating Lists
  • Persistent Data Structures and Tail Call Optimization
  • List Append and Prepend
  • Getting the Value at Index
  • Modifying a List Value

FP and Binary Trees

  • Node Definitions
  • Building the Tree
  • Comparing Trees
  • The Accumulator Idiom
  • Binary Search Trees

FP List Algorithms

  • Binary Numbers
  • Greedy Algorithms and Backtracking

Apply for certification

 For Support