Write A Program to Calculate Square Root in C

Introduction

The square root of a number is a value that, when multiplied by itself, gives the original number. For example, the square root of 16 is 4 because 4 × 4 = 16. Calculating square roots is essential in various fields such as mathematics, physics, engineering, and computer science.

In C programming, you can calculate square roots using the standard library function sqrt() from the math.h header file. However, you can also implement custom algorithms to calculate square roots without relying on external libraries. This guide explores different methods to calculate square roots in C.

Methods to Calculate Square Root

There are several methods to calculate square roots in C:

• Using the standard library function sqrt()
• Using Newton's method (also known as the Heron's method)
• Using binary search method

Each method has its own advantages and disadvantages in terms of accuracy, performance, and complexity. The choice of method depends on the specific requirements of your application.

Using Standard Library Function

The simplest way to calculate square roots in C is to use the sqrt() function from the math.h header file. This function takes a double-precision floating-point number as input and returns its square root.

Here is an example of how to use the sqrt() function in a C program:

#include <stdio.h>
#include <math.h>

int main() {
    double x = 16.0;
    double result = sqrt(x);
    printf("Square root of %.2f is %.2f\n", x, result);
    return 0;
}

This program calculates the square root of 16.0 and prints the result. The output will be:

Square root of 16.00 is 4.00

Newton's Method

Newton's method, also known as the Newton-Raphson method, is an iterative algorithm to find successively better approximations to the roots of a real-valued function. It can be used to calculate square roots by solving the equation x² - a = 0, where a is the number for which you want to calculate the square root.

Here is an example of how to implement Newton's method to calculate square roots in C:

#include <stdio.h>

double sqrt_newton(double a) {
    double x = a / 2.0; // Initial guess
    double prev_x;
    do {
        prev_x = x;
        x = (x + a / x) / 2.0;
    } while (x != prev_x);
    return x;
}

int main() {
    double x = 16.0;
    double result = sqrt_newton(x);
    printf("Square root of %.2f is %.2f\n", x, result);
    return 0;
}

This program calculates the square root of 16.0 using Newton's method and prints the result. The output will be:

Square root of 16.00 is 4.00

Binary Search Method

The binary search method is another approach to calculate square roots by iteratively narrowing down the range in which the square root lies. This method is based on the fact that the square root of a number a lies between 0 and a.

Here is an example of how to implement the binary search method to calculate square roots in C:

#include <stdio.h>

double sqrt_binary_search(double a) {
    double low = 0.0;
    double high = a;
    double mid;
    double epsilon = 0.00001; // Precision
    while (high - low > epsilon) {
        mid = (low + high) / 2.0;
        if (mid * mid < a) {
            low = mid;
        } else {
            high = mid;
        }
    }
    return (low + high) / 2.0;
}

int main() {
    double x = 16.0;
    double result = sqrt_binary_search(x);
    printf("Square root of %.2f is %.2f\n", x, result);
    return 0;
}

This program calculates the square root of 16.0 using the binary search method and prints the result. The output will be:

Square root of 16.00 is 4.00

Comparison of Methods

Here is a comparison of the three methods to calculate square roots in C:

The standard library function is the fastest and simplest method, but it requires linking with the math library. Newton's method is more complex but provides high accuracy and good performance. The binary search method is the slowest and least accurate but does not require any external libraries.