Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
rwitts
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
rwitts
13y ago
Very nice! I'm glad that you worried about this and I have to admit that your asymptotic example is nicer than mine.
2.
▲
by
rwitts
13y ago
This is a very interesting article. A minor quibble - it is very difficult to find a paradigm in which the running time of the proposed algorithm differs from simply choosing the best of the obvious algorithms. Line at a time takes O( max(w