This article deals with the evaluation of six segregated high-resolution pressure-based algorithms, which extend the SIMPLE, SIMPLEC, PISO, SIMPLEX, SIMPLEST, and PRIME algorithms, originally developed for incompressible flow, to compressible flow simulations. The algorithms are implemented within a single grid, a prolongation grid, and a full multigrid method and their performance assessed by solving problems in the subsonic, transonic, supersonic, and hypersonic regimes. This study clearly demonstrates that all algorithms are capable of predicting fluid flow at all speeds and qualify as efficient smoothers in multigrid calculations. In terms of CPU efficiency, there is no global and consistent superiority of any algorithm over the others, even though PRIME and SIMPLEST are generally the most expensive for inviscid flow problems. Moreover, these two algorithms are found to be very unstable in most of the cases tested, requiring considerable upwind bleeding (up to 50%) of the high-resolution scheme to promote convergence. The most stable algorithms are SIMPLEC and SIMPLEX. Moreover, the reduction in computational effort associated with the prolongation grid method reveals the importance of initial guess in segregated solvers. The most efficient method is found to be the full multigrid method, which resulted in a convergence acceleration ratio, in comparison with the single grid method, as high as 18.4.