O(2^n)

Term side of the Card
Topic: Complexity Analysis
Unit title: O(2^n)
Categories: Concept
Explanation side of the Card

Explanation: The complexity class where execution time grows exponentially with input size. Often seen in recursive algorithms without efficient pruning, such as the naive Fibonacci algorithm.

Edit on GitHubContributions in our content repository are 🤗 welcome from everyone.Link leads to the Contributions guidelines on GitHubLink leads to the content repository on GitHub