Data hiding in Java - Time & Space Complexity

Time Complexity: Data hiding

O(1)

Understanding Time Complexity

We want to understand how the time it takes to run code changes when we use data hiding in Java.

Specifically, does hiding data affect how long the program takes to run?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

public class Person {
  private String name;  // hidden data

  public Person(String name) {
    this.name = name;
  }

  public String getName() {
    return name;
  }
}
    

This code hides the name inside the Person class and provides a method to access it.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Accessing the hidden data through the getter method.
• How many times: Each time the getName() method is called, it returns the stored name in constant time.

How Execution Grows With Input

Getting the hidden data does not depend on the size of any input; it always takes the same amount of time.

Input Size (n)	Approx. Operations
10	1
100	1
1000	1

Pattern observation: The time to access the hidden data stays the same no matter how many objects or data items exist.

Final Time Complexity

Time Complexity: O(1)

This means accessing hidden data takes the same short time every time, no matter how much data there is.

Common Mistake

[X] Wrong: "Data hiding makes accessing data slower because it adds extra steps."

[OK] Correct: Accessing hidden data through a method is just a simple step and does not slow down the program as input size grows.

Interview Connect

Understanding that data hiding does not add time cost helps you explain clean design without worrying about performance.

Self-Check

"What if the getter method did some extra work like searching a list? How would the time complexity change?"