Comment Re:Maximize (Score 1) 1002
For a start, how the hell do you even get a CS degree without doing any interfaces?
Easy: by studying real Computer Science.
For a start, how the hell do you even get a CS degree without doing any interfaces?
Easy: by studying real Computer Science.
If you can't type very fast you'll never be a very productive programmer.
I'm not a very fast typer but I'm a very productive programmer. Maybe it's because I do more thinking than banging my keyboard
Your definition of NP-Complete isn't quite accurate. Np-Complete isn't made by NP and NP-Hard. NP-Hard IS NP-Complete for yes/no type problems. NP-Hard == NP-Complete, and both are a subset of NP.
Think of any NP-Complete problem, such as the famous Travelling Salesman Problem: given a weighted graph G, find a minimum cost Hamiltonian Cycle on it (visit every vertex exactly once, and do it while minimizing the cost of travel). We can convert this from an optimization problem to a yes/no problem. Given a graph G and a value K, is there a Hamiltonian Cycle in G with cost less than or equal to K?
The first problem is NP-Complete, the second is NP-Hard. Essentially they're the same problem, just one outputs a number, and other outputs yes or no.
Machines have less problems. I'd like to be a machine. -- Andy Warhol