We propose a new algorithm for the computation of the radical of an ideal in a polynomial ring. In recent years many algorithms have been proposed. A common technique used is to reduce the problem to the zero dimensional case. In the algorithm we present here, we use this reduction, but we avoid the redundant components that appeared in other algorithms. As a result, our algorithm is in some cases more efficient.