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.