WebSocket for live updates in Raspberry Pi - Time & Space Complexity

Time Complexity: WebSocket for live updates

O(n)

Understanding Time Complexity

When using WebSocket for live updates, it is important to understand how the program's work grows as more messages arrive.

We want to know how the time to handle updates changes when the number of messages increases.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

// Pseudocode for WebSocket message handling
websocket.on('message', (msg) => {
  processMessage(msg);  // handle one message
});

function processMessage(msg) {
  updateDisplay(msg);  // update UI with new data
}
    

This code listens for messages from a WebSocket and updates the display each time a message arrives.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Handling each incoming message one by one.
• How many times: Once per message received from the WebSocket connection.

How Execution Grows With Input

Each new message causes one update operation. So, if more messages come, the total work grows directly with the number of messages.

Input Size (n)	Approx. Operations
10 messages	10 update calls
100 messages	100 update calls
1000 messages	1000 update calls

Pattern observation: The work grows in a straight line as messages increase.

Final Time Complexity

Time Complexity: O(n)

This means the time to handle messages grows directly with the number of messages received.

Common Mistake

[X] Wrong: "Handling one message takes the same total time no matter how many messages come later."

[OK] Correct: Each message requires its own processing time, so more messages mean more total work.

Interview Connect

Understanding how live updates scale helps you explain how your code will behave with many users or messages, a useful skill in real projects.

Self-Check

What if we batch multiple messages together before updating the display? How would the time complexity change?