📄 Abstract
As budding computer scientists, we often find ourselves captivated by the sheer elegance and power of algorithms. But beyond just making things work, there’s this persistent, almost philosophical question: how do we make them work better? This paper is our humble attempt to explore that very question through the lens of a seemingly simple mathematical operation: finding the square root of a number. We embarked on a fascinating journey, delving into the ancient wisdom of iterative methods, particularly the Babylonian method—a brilliant precursor to the more generalized Newton-Raphson technique. Our hands-on adventure involved crafting our own cal_sqrt() function in Python, a labor of love that allowed us to truly appreciate the mechanics. Then came the moment of truth: pitting our creation against Python’s highly optimized, built-in math.sqrt() function. It wasn’t just about speed; it was about understanding why one was faster, unraveling the mysteries of algorithmic time complexity, and ultimately, marveling at the incredible synergy between mathematical theory and hardware innovation that makes modern computing so astonishingly efficient.
🏷️ Keywords
📚 How to Cite:
Nivaashan D, Dharsheel R , FINDING THE SQUARE ROOT OF A NUMBER USING ITERATIVE METHOD BY IMPLEMENTING CAL_SQR_RT() FUNCTION AND FINDING THE SQ ROOT USING MATHEMATICAL FUNCTION OF MATH LIBRARY OF A LANGUAGE, FURTHER EFFICIENCY OF THE ALGORITHM USING THE TIME COMPLEXITY - A CASE STUDY , Volume 12 , Issue 6, June 2026, EPRA International Journal of Multidisciplinary Research (IJMR) , Pages: 722 - 725 ,