No, an algorithm cannot be NPC.  The idea behind NPC is that the problem
itself is NP and NPC.  Both talk about properties of the problem and/or
the implications of finding a polynomial time algorithm to solve the
problem.  The notion that a particular algorithm's runtime itself is NPC 
doesn't make sense in the context of the question.