String comparison (-like, -match) in PowerShell - Time & Space Complexity

Time Complexity: String comparison (-like, -match)

O(n)

Understanding Time Complexity

When we compare strings using -like or -match in PowerShell, the time it takes depends on the length of the strings and the pattern.

We want to understand how the work grows as the strings get longer.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

$string = "HelloWorld"
$pattern = "Hello*"
if ($string -like $pattern) {
    Write-Output "Match found"
} else {
    Write-Output "No match"
}

This code checks if the string matches the pattern using the -like operator, which supports simple wildcard matching.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Comparing characters of the string to the pattern one by one.
• How many times: Up to the length of the string or pattern, whichever is shorter.

How Execution Grows With Input

As the string or pattern gets longer, the comparison checks more characters.

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

Pattern observation: The work grows roughly in a straight line with the length of the string or pattern.

Final Time Complexity

Time Complexity: O(n)

This means the time to compare grows directly with the length of the string or pattern.

Common Mistake

[X] Wrong: "String comparison with -like or -match is always instant, no matter the string size."

[OK] Correct: The comparison checks characters one by one, so longer strings take more time.

Interview Connect

Understanding how string comparisons scale helps you write scripts that stay fast even with bigger data.

Self-Check

"What if we used -match with a complex regular expression instead of -like? How would the time complexity change?"