Determination of Multiplication Algorithm with Basis on Pascal Triangle

Multiplication algorithms have a crucial role with occuring of approximately 10% in operating systems such as Windows, Linux, Mac OS, IOS, DOS and etc. Furthermore, these types of algorithms which are related with multiplication have to make an efficient impact on speed of CPU. Nevertheless, a lot of investigators have been making research on both improvement and optimising of methods to make a huge stride on increasing efficiency of processor’s speed. In this article, a new multiplication algorithm going to be introduced with basis on the cooperation of pascal triangle and also given specific examples about the other basic multiplication algorithms which are, Karatsuba and Nikhilam. However, results of pascal multiplication algorithm with respect to a factor of complexity analysis have been evaluated and compared to complexity of Karatsuba and classical multiplication.