Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
fwg
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
fwg
4y ago
Yes it is. Big-O means given an arbitrary function of some complexity, it is definitely bounded by this other function from the top, i.e. that other function is always larger than our arbitrary function. f(n) \in O(n^2) means n^2 (ignoring