O(n)

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

Explanation: The complexity class where execution time grows linearly with input size. Found in simple loops and other algorithms that process each element once.

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