Y
Hacker News
new
|
ask
|
show
|
jobs
by
robconery
2637 days ago
The Big O of an algorithm
does not change
based on data size. Even if your set had precisely 1 record in it - the code you write, if it loops over every item in the set (even if it's only one item) - is
still O(n)
.
1 comments
roel_v
2637 days ago
Yes I know that - was this reply meant for another comment?
link