A data structure is a way of representing data in a program, and storing it in memory. There are many structures with their pros and cons, and uses cases. In these notes, we are going to go through some of them and look at how they function and when to use them.
Static Array# Arrays are a contiguous (non-breaking) space in memory with an index for each byte of memory.
big-o
Big O complexity notation is used to give a general idea of the performance of an algorithm in terms of resources such as time or memory as the input grows larger. It is not a measure of true performance and is only a guide. The differences between the various algorithms are only seen on really large inputs.
The notation uses the syntax $O(v)$ where $v$ is an expression of complexity. d