Stretched hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topological properties and VLSI aspects of this network. In this paper, we propose some deterministic and adaptive routing algorithms for the stretched hypercubes. The performance of stretched hypercubes using the proposed routing algorithms is then evaluated by means of simulation experiments. Experiments are realized under different working loads and for different network factors.