Why functions are needed in Go - Performance Analysis

Time Complexity: Why functions are needed

O(n)

Understanding Time Complexity

Functions help us organize code into reusable parts. Understanding their time cost helps us see how adding functions affects program speed.

We want to know how using functions changes the number of steps the program takes.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

package main

import "fmt"

func greet(name string) {
    fmt.Println("Hello,", name)
}

func main() {
    greet("Alice")
    greet("Bob")
}

This code defines a function to say hello and calls it twice with different names.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Calling the greet function twice.
• How many times: 2 times, once for each name.

How Execution Grows With Input

Each function call does a fixed amount of work (printing a greeting). More calls mean more work.

Input Size (number of calls)	Approx. Operations
1	1 greeting printed
10	10 greetings printed
100	100 greetings printed

Pattern observation: The work grows directly with how many times the function is called.

Final Time Complexity

Time Complexity: O(n)

This means the total work grows in a straight line as you call the function more times.

Common Mistake

[X] Wrong: "Functions always make the program slower because they add extra steps."

[OK] Correct: Functions organize code but the total work depends on how many times you run the code inside them, not just that they exist.

Interview Connect

Knowing how functions affect time helps you write clear code without surprises about speed. It shows you can think about both design and performance.

Self-Check

"What if the greet function called itself recursively? How would the time complexity change?"