An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2 n and the algorithm for computing the linear complexity of a binary sequence with period pn,where 2 is a primitive root modulo p2.