What is the space complexity of an algorithm for storing elements in an array of size n?
When you store elements in an array of size n, the space required is directly proportional to the size of the array, which is n. Each element takes up a constant amount of space, so the overall space required is O(n).