📄 Abstract
String transformation operations constitute a core task profile within algorithmic systems, text parsing engines, and computational linguistic pipelines. Among these operations, flipping individual character casing—mapping alphabetic tokens from uppercase to lowercase and vice versa—represents a foundational manipulation. This study presents an end-to-end evaluation comparing a user-defined algorithm, which executes individual character mapping using direct ASCII ordinal offsets, against Python’s highly abstracted native string method, str.swapcase(). We formalize their execution mechanics, algorithmic procedures, and theoretical asymptotic limits. While both paradigms share a linear time complexity boundary of O(n) and linear space requirements, empirical execution metrics unveil a persistent performance delta. The native approach completes the task profile with an optimized execution window due to low-level optimized C implementation and memory layout efficiencies embedded within CPython’s underlying C stack. Ultimately, this work bridges high-level semantic programming with low-level execution pipelines, providing empirical evidence supporting the use of native functional abstractions for massive data payloads.
📚 How to Cite:
E Tanish, R Pranav , SWAPPING THE CASE OF A GIVEN STRING USING GENERALISED APPROACH USING IN A FUNCTION CALLED CASE_SWAPPING() AND SWAPPING THE CASE OF STRING USING BUILT IN METHOD,FURTHER COMPARISON OF BOTH THE APPROACHES USING THE TIME COMPLEXITY OF THESE ALGORITHMS - A CASE STUDY , Volume 12 , Issue 6, June 2026, EPRA International Journal of Multidisciplinary Research (IJMR) , Pages: 950 - 955 ,