📄 Abstract
In the field of computer science, strings are one of the most commonly used data structures for storing and processing textual information. Determining the size or length of a string is a fundamental operation in programming and is frequently used in searching, sorting, validation, parsing, and data-processing applications. The efficiency of a program often depends on how effectively such basic operations are performed. Most programming languages provide built-in functions to determine the length of a string. In Python, the built-in function len() is used to calculate the number of characters present in a string. Although this function is highly optimized, understanding the methodology behind string-length estimation is important for learners and researchers in computer science. This manuscript implements the function find_string_size(), which estimates the size of a string by traversing each character individually. Further, the execution of the methodology is examined and compared with the built-in len() function. The study also analyzes the time complexity and space complexity of the proposed methodology using asymptotic notations and evaluates its efficiency. \ In addition to theoretical analysis, the efficiency of the proposed methodology is experimentally evaluated using Python's time module. The execution time of find_string_size() is measured and compared with the built-in len() function for various input sizes. The observed results are further analyzed using asymptotic notations to determine the computational efficiency of both approaches.
🏷️ Keywords
📚 How to Cite:
A Krishaang, G V Karthihesh , IMPLEMENTATION OF find_string_size() FUNCTION TO ESTIMATE THE SIZE OF THE STRING AND COMPARING WITH BUILT-IN FUNCTION len (), FURTHER CHECKING THE EFFICIENCY OF find_string_size() METHODOLOGY USING ASYMPTOTIC NOTATIONS - A CASE STUDY , Volume 12 , Issue 6, June 2026, EPRA International Journal of Multidisciplinary Research (IJMR) , Pages: 726 - 730 ,