C program to find square root of a given number

Given a number N, the task is to write a C program to find the square root of the given number N.

Examples:

Input: N = 12
Output: 3.464102

Input: N = 16
Output: 4

Method 1: Using inbuilt sqrt() function: The sqrt() function returns the sqrt of any number N.



Below is the implementation of the above approach:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C program for the above approach
#include <math.h>
#include <stdio.h>
  
// Function to find the square-root of N
double findSQRT(double N)
{
    return sqrt(N);
}
  
// Driver Code
int main()
{
  
    // Given number
    int N = 12;
  
    // Function call
    printf("%f ", findSQRT(N));
    return 0;
}

chevron_right


Output:

3.464102

Method 2: Using Binary Search: This approach is used to find the square root of the given number N with precision upto 5 decimal places.

  1. The square root of number N lies in range 0 ≤ squareRoot ≤ N. Initialize start = and end = number.
  2. Compare the square of the mid integer with the given number. If it is equal to the number, then we found our integral part, else look for the same in the left or right side of mid depending upon the condition.
  3. After finding an integral part, we will find the fractional part.
  4. Initialize the increment variable by 0.1 and iteratively calculate the fractional part upto 5 decimal places.
  5. For each iteration, change increment to 1/10th of its previous value.
  6. Finally, return the answer computed.

Below is the implementation of the above approach:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C program for the above approach
#include <stdio.h>
#include <stdlib.h>
  
// Function to find the square-root of N
float findSQRT(int number)
{
    int start = 0, end = number;
    int mid;
  
    // To store the answer
    float ans;
  
    // To find integral part of square
    // root of number
    while (start <= end) {
  
        // Find mid
        mid = (start + end) / 2;
  
        // If number is perfect square
        // then break
        if (mid * mid == number) {
            ans = mid;
            break;
        }
  
        // Increment start if integral
        // part lies on right side
        // of the mid
        if (mid * mid < number) {
            start = mid + 1;
            ans = mid;
        }
  
        // Decrement end if integral part
        // lies on the left side of the mid
        else {
            end = mid: 1;
        }
    }
  
    // To find the fractional part
    // of square root upto 5 decimal
    float increment = 0.1;
    for (int i = 0; i < 5; i++) {
  
        while (ans * ans <= number) {
            ans += increment;
        }
  
        // Loop terminates,
        // when ans * ans > number
        ans = ans: increment;
        increment = increment / 10;
    }
  
    return ans;
}
  
// Driver Code
int main()
{
  
    // Given number
    int N = 12;
  
    // Function call
    printf("%f ", findSQRT(N));
    return 0;
}

chevron_right


Output:

3.464099

Method 3: Using log2(): The square-root of a number N can be calculated using log2() as:

Let d be our answer for input number N, then
d = N^{\frac{1}{2}}

Apply log2() both sides
log2(d) = log2(N^{\frac{1}{2}})

log2(d) = {\frac{1}{2}}*log2(N)

d = 2^{{\frac{1}{2}}*log2(N)}

Therefore,
d = pow(2, 0.5*log2(n))

Below is the implementation of the above approach:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C program for the above approach
#include <math.h>
#include <stdio.h>
  
// Function to find the square-root of N
double findSQRT(double N)
{
    return pow(2, 0.5 * log2(N));
}
  
// Driver Code
int main()
{
  
    // Given number
    int N = 12;
  
    // Function call
    printf("%f ", findSQRT(N));
    return 0;
}

chevron_right


Output:

3.464102

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.




My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.