🧠

DSA Flashcards

Master core Data Structures & Algorithms concepts with interactive flashcards

1
Current
0
Reviewed
17
Total
0%
Progress
0%
0/17
Mastered
⏱️
Basic
Time Complexity

Big-O Notation

Click to reveal explanation

💡
Explanation

Mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. It represents the upper bound of algorithmic complexity.

Click to flip back