O(n^2)

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

Explanation: The complexity class where execution time scales with the square of input size. Found in algorithms with nested loops, such as selection sort.

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