  In this paper we prove a KAM-like theorem of symplectic algorithms for nearly
integrable Hamiltonian systems which generalises the result of \cite{r1} and
\cite{r6} for the case of integrable systems.
