---

‎The goal of this paper is to introduce the contraction method for analysing the algorithms‎.

‎By means of this method several interesting classes of recursions can be analyzed as paricular cases of the general framework‎. ‎The main steps of this technique is based on contraction properties of algorithm with respect to suitable probability metrics‎. ‎Typlically the limiting distribution is characterized as a fixed poin of a limiting operator on the class of probability distributions‎.‎