In this paper we provide backward and forward roundoff error estimates of the modified Gram-Schmidt algorithm with column pivoting. It turns out that the row-wise growth factors of this algorithm are bounded. Furthermore, if the coefficient matrix is well conditioned, then with properly chosen tolerance η, this algorithm can also correctly determine the numerical rank of the coefficient matrix. We also derive a forward roundoff error estimate of this algorithm for the solution of the least squares problem.