📄 Abstract
Searching for minimum values in data sets is ubiquitous in computer science and software development. Being able to easily find the smallest value is especially important for sorting and optimization algorithms, for scheduling and for data analysis. Here, two methods for finding minimum values in C++ vectors are compared. The first is an STL (Standard Template Library) function, min_element(), and the other is the Linear Search method. The methods are compared in terms of their implementation and the way they work. Their computational complexities are compared too. Both methods are expected to have the same time complexity in practice, that is O(n). However, they differ in the degree to which they are convenient for programming and maintainability compared to each other.
🏷️ Keywords
📚 How to Cite:
G V Karthihesh, , A Krishaang , SEARCHING FOR THE MINIMUM ELEMENT IN A VECTOR USING BUILT-IN FUNCTION min_element() AND LOCATING THE MINIMUM ELEMENT FROM THE VECTOR USING POPULAR SEARCHING TECHNIQUE LINEAR SEARCH METHODOLOGY, FURTHER ANALYZING THE TIME COMPLEXITY OF THESE ALGORITHMS – A CASE STUDY , Volume 12 , Issue 6, June 2026, EPRA International Journal of Multidisciplinary Research (IJMR) , Pages: 695 - 699 ,