Multiple return values in Go - Time & Space Complexity

Time Complexity: Multiple return values

O(n)

Understanding Time Complexity

When a function returns multiple values, we want to know how this affects the time it takes to run.

Does returning more than one value make the program slower as input grows?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

func findMinMax(numbers []int) (int, int) {
    min, max := numbers[0], numbers[0]
    for _, num := range numbers {
        if num < min {
            min = num
        }
        if num > max {
            max = num
        }
    }
    return min, max
}

This function finds the smallest and largest numbers in a list and returns both.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: One loop through the list of numbers.
• How many times: Once for each number in the list.

How Execution Grows With Input

As the list gets bigger, the function checks each number once.

Input Size (n)	Approx. Operations
10	About 10 checks
100	About 100 checks
1000	About 1000 checks

Pattern observation: The work grows directly with the number of items.

Final Time Complexity

Time Complexity: O(n)

This means the time to run grows in a straight line with the input size.

Common Mistake

[X] Wrong: "Returning two values takes twice as long as returning one."

[OK] Correct: Returning multiple values is just sending back results once the work is done; it does not repeat the work or slow the loop.

Interview Connect

Understanding how multiple return values affect time helps you explain your code clearly and shows you know what really costs time in programs.

Self-Check

"What if the function returned the min and max plus the count of numbers? How would the time complexity change?"