undefined | Better HN

0 pointsmitthrowaway210mo ago0 comments

In the article it's apparently "time since launch".

Kind of like how an O(n^2) sorting algorithm sorts n^2 elements in time n. Right?

0 comments

No, it's the opposite. An O(n^2) algorithm sorts n items in n^2 time. So O(n^2) is worse than O(n).

(should really be θ rather than O but you get my point)

j / k navigate · click thread line to collapse

0 pointsmitthrowaway210mo ago0 comments

In the article it's apparently "time since launch".

Kind of like how an O(n^2) sorting algorithm sorts n^2 elements in time n. Right?

No, it's the opposite. An O(n^2) algorithm sorts n items in n^2 time. So O(n^2) is worse than O(n).

(should really be θ rather than O but you get my point)

j / k navigate · click thread line to collapse