Calculation on Euler Arithmetic Complexity using Big O Notation

Compute the complexity of algorithm is such way to describe it efficiency.Algorithm complexity computes the total time taken by an algorithm.It computes the time of the algorithm to run as the length of the input in the function.This paper describes the efficiency of algorithm complexity of Euler Arithmetic.The efficiency is determines by analyzing the run time of the algorithm using Big O.It only compared the complexity of the algorithm using notation of O(1) and O(n).Then, the result is analyzed using best case and worst case.As the result, the algorithm can be solving using both O(1) and O(n).However worst case gives better complexity for thisalgorithm even in small or higher step size compare to best scenario.This is because time taken on the size of the data N decreases as the value of N increases in O(n).