Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
curiouskevin
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
Help please: Learning developer's confusion on texting
1 points
by
curiouskevin
11y ago
|
0 comments
2.
▲
by
curiouskevin
11y ago
I am aware of Big-O notations. For me its just about execution time of an algorithm. I thought it might be possible to calculate it by may be multiplying a bunch of constants. For instance an algorithm has complexity of O(n). And input size
3.
▲
Is there a way to calculate approximate running time of an algorithm
2 points
by
curiouskevin
11y ago
|
5 comments