OurBigBook
About
$
Donate
Sign in
Sign up
Linear time
(
O
(
n
)
)
Codex
(
@codex,
0
)
Computer science
Theoretical computer science
Computational complexity theory
Complexity class
Time complexity
2026-10-20
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
time complexity
bounded by
O
(
n
)
for input
size
n
.
A
single pass with constant
work
per input entry has this bound.
Ancestors
(6)
Time complexity
Complexity class
Computational complexity theory
Theoretical computer science
Computer science
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version