API token management in Jenkins - Time & Space Complexity

Time Complexity: API token management

O(n)

Understanding Time Complexity

We want to understand how the time to manage API tokens changes as the number of tokens grows in Jenkins.

Specifically, how does the system handle adding, checking, or deleting tokens when there are many tokens?

Scenario Under Consideration

Analyze the time complexity of the following Jenkins pipeline snippet that checks for a token in a list.

    def tokens = ['token1', 'token2', 'token3', 'token4']
    def inputToken = 'token3'
    def tokenFound = false
    for (t in tokens) {
      if (t == inputToken) {
        tokenFound = true
        break
      }
    }
    return tokenFound
    

This code searches through a list of tokens to find if the input token exists.

Identify Repeating Operations

Look for repeated actions that take time as input grows.

• Primary operation: Looping through the list of tokens one by one.
• How many times: Up to the total number of tokens, until the token is found or list ends.

How Execution Grows With Input

As the number of tokens increases, the time to find a token grows roughly in a straight line.

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

Pattern observation: The time grows directly with the number of tokens; doubling tokens roughly doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to find a token grows linearly with the number of tokens stored.

Common Mistake

[X] Wrong: "Checking for a token always takes the same time no matter how many tokens there are."

[OK] Correct: Because the code checks tokens one by one, more tokens mean more checks, so time grows with the list size.

Interview Connect

Understanding how searching through tokens scales helps you explain how Jenkins manages security efficiently as systems grow.

Self-Check

"What if we stored tokens in a map (dictionary) instead of a list? How would the time complexity change?"