Since it was realized that the Curry-Howard isomorphism can be extended to the case of classical logic as well, several calculi have appeared as candidates for the encodings of proofs in classical logic. One of the most extensively studied among them is the λµ-calculus of Parigot [Par.92]. In this paper, based on the result of Xi presented for the λ-calculus [Xi.99], we give an upper bound for the lengths of the reduction sequences in the λµ-calculus extended with the ρ-and θ-rules. Surprisingly, our results show that the new terms and the new rules do not add to the computational complexity of the calculus despite the fact that µ-abstraction is able to consume an unbounded number of arguments by virtue of the µ-rule.