How do pure functions affect performance?

Can you explain how pure functions impact the performance of my code?

Sure! Pure functions are those that always return the same output for the same input and have no side effects. This predictability can enhance performance by enabling optimizations like memoization.

What is memoization, and how does it relate to pure functions?

Memoization is a technique where the results of expensive function calls are cached, so that subsequent calls with the same inputs can return the cached result instead of recalculating it. Pure functions are ideal for memoization because their output is consistent.

Are there any downsides to using pure functions?

While pure functions offer many benefits, they can sometimes lead to performance issues if they require complex calculations or if the overhead of creating new data structures outweighs the benefits of immutability.

How can I identify if a function is pure?

A function is pure if it meets two criteria: it always produces the same output for the same input, and it does not cause any side effects, such as modifying external state or variables.