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?
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.
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?
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.