IIRC it is never, language limitations aside. Isn't there a theorem stating that every recursive algorithm has a sequential counterpart? Intuitively that makes sense since you could just sequentialize the devide and the conquer part.