การเรียกซ้ำและฟังก์ชันลำดับสูง

Welcome to recursion! In functional programming, recursion is a powerful technique where a function calls itself to solve a problem.

Instead of using loops (like for or while in other languages), Elixir often relies on recursion to iterate over data or repeat actions. It's a core concept you'll use a lot!

Every recursive function needs two main parts to work correctly:

• Base Case: This is the stopping condition. It defines when the function should stop calling itself and return a direct result. Without it, your function would run forever!
• Recursive Step: This is where the function calls itself again, but with a smaller or simpler version of the original problem. Each call moves closer to the base case.

Let's see recursion with a classic example: calculating the factorial of a number. The factorial of n (written as n!) is the product of all positive integers less than or equal to n. For example, 5! = 5 * 4 * 3 * 2 * 1 = 120.

Notice how factorial(n) calls factorial(n - 1) until it hits the base case of 0.

While recursion is great, naive recursion can sometimes lead to performance issues or 'stack overflows' for very deep calls.

Elixir (and the Erlang VM) offers Tail Call Optimization (TCO). If the recursive call is the very last operation in a function, the VM can optimize it, preventing new stack frames from being created. This makes tail-recursive functions as efficient as loops!

To achieve TCO, we often use an accumulator. This is an extra argument passed to the function that collects the result as the recursion progresses.

Compare this version to the previous one. The recursive call factorial(n - 1, n * acc) is the last thing happening in the function, making it tail-recursive.

Now, let's explore Higher-Order Functions (HOFs). In Elixir, functions are 'first-class citizens'. This means you can:

• Pass functions as arguments to other functions.
• Return functions as results from other functions.
• Assign functions to variables.

HOFs enable powerful abstractions, making your code more concise, flexible, and reusable.

Enum.map/2 is one of the most common HOFs. It takes an enumerable (like a list) and a function. It applies that function to each element and returns a new list with the transformed elements.

It never modifies the original list, embracing Elixir's immutability.

Another handy HOF is Enum.filter/2. It takes an enumerable and a function that should return a boolean (true or false).

It returns a new list containing only the elements for which the function returned true. It's perfect for selecting specific items from a collection.

Enum.reduce/3 is perhaps the most powerful HOF for working with enumerables. It takes an enumerable, an initial accumulator value, and a function.

It iterates through the collection, applying the function to each element and the current accumulator, eventually reducing the entire collection to a single value.

You've seen fn n -> n * 2 end. These are anonymous functions (or lambdas). Elixir provides a shorthand for simple anonymous functions:

• &1 refers to the first argument.
• &2 refers to the second argument, and so on.
• &(&1 + &2) is equivalent to fn a, b -> a + b end.

This makes HOF calls even more concise!

Higher-Order Functions are a cornerstone of functional programming in Elixir. Let's check your understanding.

Great job! In this lesson, you've grasped two fundamental concepts in functional Elixir:

• Recursion: A function calling itself, defined by a base case and a recursive step.
• Tail Call Optimization (TCO): An important Elixir feature for efficient, stack-safe recursion, often achieved with an accumulator.
• Higher-Order Functions (HOFs): Functions that take other functions as arguments or return them, like Enum.map, Enum.filter, and Enum.reduce.
• Anonymous Functions: Concise ways to define functions inline, often used with HOFs, including the &1 shorthand.

These tools are essential for writing expressive and powerful Elixir code. Keep practicing!