ls (list files and directories) in Linux CLI - Time & Space Complexity

Time Complexity: ls (list files and directories)

O(n)

Understanding Time Complexity

When we run the ls command, it shows files and folders in a directory. Understanding how its speed changes with more files helps us know what to expect.

We want to see how the time to list files grows as the number of files increases.

Scenario Under Consideration

Analyze the time complexity of the following command.

ls -l /path/to/directory

This command lists all files and directories in detailed format inside the given path.

Identify Repeating Operations

Look at what repeats when ls runs:

• Primary operation: Reading each file or directory entry to gather info.
• How many times: Once for every item inside the directory.

How Execution Grows With Input

As the number of files grows, the time to list them grows too.

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

Pattern observation: The work grows directly with the number of files. Double the files, double the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to list files grows in a straight line with how many files there are.

Common Mistake

[X] Wrong: "ls runs instantly no matter how many files there are."

[OK] Correct: Each file needs to be read and shown, so more files take more time.

Interview Connect

Knowing how commands like ls scale helps you understand real-world scripts and system tasks. It shows you how input size affects speed, a key skill in scripting and automation.

Self-Check

What if we add the -R option to ls to list files recursively? How would the time complexity change?