Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
alta22433
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
alta22433
12y ago
Yeah, seems like the article implies an upper bound of 2^n for a greedy solution, so your example would be pretty bad with a worst case of 2^1000?
2.
▲
by
alta22433
12y ago
I was asked this on a recent programming interview. As a recent college graduate, I'm not sure this is a fair question to ask under that context given the complexity of the problem. Nice article though.