less and more (paginated viewing) in Linux CLI - Time & Space Complexity

Time Complexity: less and more (paginated viewing)

O(n)

Understanding Time Complexity

When using commands like less or more to view files page by page, it's important to understand how the time to display content grows as the file size increases.

We want to know how the command's work changes when the file gets bigger.

Scenario Under Consideration

Analyze the time complexity of the following command usage.

less largefile.txt
more largefile.txt

These commands show the content of a file one screen at a time, letting the user scroll through it.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Reading and displaying one screen (page) of text at a time.
• How many times: Once per page viewed by the user, until the file ends or user quits.

How Execution Grows With Input

As the file size grows, the total number of pages increases, so the total reading and displaying work grows roughly in proportion to the file size.

Input Size (lines)	Approx. Pages
100	About 4 pages (if 25 lines per page)
1000	About 40 pages
10000	About 400 pages

Pattern observation: The number of pages grows linearly with the file size, so the work grows linearly too.

Final Time Complexity

Time Complexity: O(n)

This means the time to view the entire file grows in direct proportion to the file size.

Common Mistake

[X] Wrong: "The commands read the whole file instantly, so time doesn't depend on file size."

[OK] Correct: These commands read and display the file page by page, so the bigger the file, the more pages to show, and more time needed.

Interview Connect

Understanding how commands handle large files helps you think about efficiency in real tasks, like processing logs or big data files. This skill shows you can reason about how tools work behind the scenes.

Self-Check

"What if the command buffered the entire file in memory before showing any page? How would the time complexity change?"