Set creation and operations in Swift - Time & Space Complexity

Time Complexity: Set creation and operations

O(n)

Understanding Time Complexity

When we create and work with sets in Swift, it's important to know how the time it takes changes as the set grows.

We want to find out how fast operations like adding or checking items happen when the set gets bigger.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

var numbers = Set()
for i in 1...n {
    numbers.insert(i)
}
let containsCheck = numbers.contains(n / 2)
    

This code creates a set by adding numbers from 1 to n, then checks if a number is in the set.

Identify Repeating Operations

• Primary operation: Inserting elements into the set inside the loop.
• How many times: The insert operation runs n times, once for each number from 1 to n.
• Additional operation: Checking if the set contains a number happens once.

How Execution Grows With Input

As n grows, the number of insert operations grows directly with n, because each number is added once.

Input Size (n)	Approx. Operations
10	About 10 insertions + 1 check
100	About 100 insertions + 1 check
1000	About 1000 insertions + 1 check

Pattern observation: The work grows steadily as the input size grows; doubling n roughly doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to create the set grows in a straight line with the number of items added.

Common Mistake

[X] Wrong: "Checking if a set contains an item takes time proportional to the size of the set."

[OK] Correct: Sets are designed to check membership very quickly, usually in constant time, no matter how big the set is.

Interview Connect

Understanding how set operations scale helps you explain efficient data handling clearly and confidently in real-world coding situations.

Self-Check

"What if we changed the set to an array and performed the same insert and contains operations? How would the time complexity change?"