My algorithm that is NP-complete in the case if P=NP

I’ve proved that if P=NP, it’s a constructive problem.

See also here.