IMPLIMENTATION OF randomize_traverse() MATHEMATICAL MODEL TO CHECK THE OCCURANCE OF GIVEN NUMBER IN A VECTOR. FURTHER COMPARISON BETWEEN

Authors

  • A Vinoth Kumar Class- XII 2023-24, Sainik School Amaravathinagar Post: Amaravathinagar,Udumalpet Taluka,Tirupur Dt,Tamilnadu State

Keywords:

linear search(ls), randomize traverse(rt), Runtime Complexity (rc), Big OO(n), Big ThetaΘ(n), Big OmegaΩ(n), Generalised approach (ga)

Abstract

In computer science efficiency of a particular software is determined by the two factors and they are, the  amount of memory that  is being used to store the data and the amount of time used for processing  .These two parameters are used  in calculating the space complexity and time complexity  of the program.

                This manuscript specifically examines the execution of checking the given number  exists in a vector or not, if it exists how many times the number occurred by using randomize_traverse()  and further comparing with the standard searching methodology linear_search() function. The purpose is to provide a alternative methodology for counting the occurrence of a given number in a vector.

Downloads

Published

-

How to Cite

A Vinoth Kumar. (2023). IMPLIMENTATION OF randomize_traverse() MATHEMATICAL MODEL TO CHECK THE OCCURANCE OF GIVEN NUMBER IN A VECTOR. FURTHER COMPARISON BETWEEN . EPRA International Journal of Multidisciplinary Research (IJMR), 9(12), 55–57. Retrieved from http://eprajournals.net/index.php/IJMR/article/view/3305

Issue

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

Section

Articles