Even if it'll be a constructive proof, it doesn't mean you could actually write the C program. It'll be like, here are the steps to construct an algorithm for this NP complete problem and then the number of steps itself is bound by n^(absurdly large number) and then prove the complexity is bound by n^(another absurdly large number). It will have zero practical consequences.