This question needs more precision to be answered: at a primary level, any MCMC algorithm that can be implemented for your problem is alright in that it produces a Markov chain that converges to the right posterior distribution. In this sense they all are exact and one cannot say Gibbs is better than Metropolis-Hastings.
At a secondary level, MCMC algorithms can be compared in terms of speed of convergence: if I start from an arbitrary $x_0$, for which $t$ is $x_t$ exactly distributed from the target density $f$? approximately distributed from the target density $f$? This is a much harder question and very little can be said for a real complex model that does require the use of MCMC... There exist deep and involved theoretical results that were obtained by researchers like Richard Tweedie, Gareth Roberts, Jeff Rosenthal, Éric Moulines, Jim Hobert, and many others (if you want to look at the literature), but it is extremely complicated to turn those results into a comparison criterion when several MCMC algorithms are competing.
A more practical if less satisfactory approach is therefore to look at some direct evaluation of convergence, for instance through the autocorrelation function or the effective sample size. Even though they do not give a complete picture of the convergence properties...