We continue our discussion about algorithms for quaternion algebras. Taking our base field to be a number field, we give an algorithm to compute a maximal order, which is the analogous question to computing the ring of integers of a number field. We also characterize the complexity class of this problem.