In this article we will propose initially a graphical method for carrying out the algorithm which is at the base of the famous Collatz Conjecture; therefore we will demonstrate analytically that, for no natural number, the Collatz Algorithm can present an infinite sequence of ever-increasing steps. The development of the graphical method will lead us to extrapolate a simplified and more basic scheme of the Collatz Conjecture, which will allow us in turn to consider the Collatz Conjecture Algorithm as a sorte of particular case of a more general algorithm valid for positive real numbers, which, for statistical reasons that we will show, will always converge towards the smallest real number, zero. The Collatz Algorithm will therefore appear as an adaptation only to the natural numbers of this more general algorithm, which is why Collatz Algorithm also tends to converge towards the smallest natural number which is 1.