CHECKING ARMSTRONG NUMBER USING FUNCTION ..

Authors

  • T Rohit Raj Class- XII 2023-24, Sainik School Amaravathinagar Post: Amaravathinagar,Udumalpet Taluka,Tirupur Dt,Tamilnadu State

Keywords:

check_arm(ca) check_rand_arm(cra), Random number (rn), Runtime Complexity (rc), Big OO(n), Big ThetaΘ(n), Big OmegaΩ(n), Generalised approach (ga)

Abstract

The time complexity of an algorithm is the amount of time taken by the algorithm to complete the execution of function of its input length, n. The time complexity of an algorithm is denoted by using asymptotic notations.

                 This manuscript specifically examines the efficiency of functions check_arm() and check_rand_arm(), these methodologies are used to find an Armstrong number in a vector. The efficiency of these two functions are calculated and assessed by using time complexity of functions. Further the space complexity also calculated, since both algorithm uses same space as per the input function. The endeavour of this paper is to express the better algorithm with respect to time.

Downloads

Published

-

How to Cite

T Rohit Raj. (2023). CHECKING ARMSTRONG NUMBER USING FUNCTION . EPRA International Journal of Multidisciplinary Research (IJMR), 9(12), 49–51. Retrieved from http://eprajournals.net/index.php/IJMR/article/view/3303

Issue

Vol. 9 No. 12 (2023): EPRA International Journal of Multidisciplinary Research (IJMR)

Section

Articles