Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
maciek12
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
2 ms
·
1.
▲
by
maciek12
2y ago
Thanks for replying, I really appreciate you taking the time to check my concerns! I was afraid I was going crazy haha. The part about big O being usually about the average case was helpful, I'm still at uni where we mostly talk about
2.
▲
by
maciek12
2y ago
Am i missing something or is the big O notation in this article wrong? For example in "Sorted sets like BTreeSet use comparisons for searching, and that makes them logarithmic over key length O(log(L)), but they are also logarithmic in