Getter and setter methods in Java - Time & Space Complexity

Time Complexity: Getter and setter methods

O(1)

Understanding Time Complexity

We want to see how the time it takes to run getter and setter methods changes as the program runs.

How does the work grow when we use these methods more?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

public class Person {
    private String name;

    public String getName() {
        return name;
    }

    public void setName(String newName) {
        this.name = newName;
    }
}

This code defines simple getter and setter methods to read and update a person's name.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Accessing or updating a single variable.
• How many times: Each method runs once per call, no loops or repeated steps inside.

How Execution Grows With Input

Each getter or setter does a fixed amount of work regardless of input size.

Number of Method Calls (n)	Approx. Operations
10	10 simple operations
100	100 simple operations
1000	1000 simple operations

Pattern observation: The work grows directly with how many times you call the methods, but each call is very quick and simple.

Final Time Complexity

Time Complexity: O(1)

This means each getter or setter runs in constant time, no matter how big your program or data is.

Common Mistake

[X] Wrong: "Getter and setter methods take longer as the program gets bigger."

[OK] Correct: Each getter or setter just reads or writes one value, so the time does not depend on program size.

Interview Connect

Understanding that simple methods like getters and setters run quickly helps you explain how your code handles data efficiently.

Self-Check

"What if a getter method computed a value by looping through a list? How would the time complexity change?"