#Computer Science

A data structure is a way of organizing data so it can be accessed and modified efficiently. This guide explains what data structures are, introduces common types like arrays and lists, and why choosing the right one matters.

Big O notation describes how an algorithm's time or space grows as input size increases. This guide explains what Big O is, common classes like O(n) and O(log n), and why it matters for writing efficient code.

Recursion is when a function calls itself to solve smaller versions of a problem. This guide explains what recursion is, why it needs a base case, how it compares to loops, and where it shines.