In this paper, we consider the problem of embedding a cycle containing number of nodes from 4 to 2n through a prescribed edge in an n-dimensional crossed cube CQn. The main contribution of this paper is providing a systematic O(l) algorithm to find a cycle of length l containing (u, v) in CQn for any (u, v Î E(CQn) nd any integer l with 4 ≤ l ≤ 2n.