DC Programming and DCA have been introduced by Pham Dinh Tao in 1986 and extensively developed by Le Thi Hoai An and Pham Dinh Tao since 1993. These approaches have been successfully applied to solving real life problems in their large scale setting. In this paper, by using the Lojasiewicz inequality for nonsmooth subanalytic functions, we investigate the convergence of DC (difference of convex) algorithm (DCA) for solving DC program with subanalytic data. The convergent rate which depends on the so-called Lojiasiewicz exponent has been established.