Find the hypotenuse of a right angled triangle with given two sides

Given the other two sides of a right angled triangle, the task is to find it’s hypotenuse.

Examples:

Input: side1 = 3, side2 = 4
Output: 5.00
32 + 42 = 52

Input: side1 = 12, side2 = 15
Output: 19.21



Approach: Pythagoras theorem states that the square of hypotenuse of a right angled triangle is equal to the sum of squares of the other two sides.

Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation of the approach
#include<bits/stdc++.h>
#include <iostream>
#include <iomanip>
using namespace std;
  
// Function to return the hypotenuse of the
// right angled triangle
double findHypotenuse(double side1, double side2)
{
    double h = sqrt((side1 * side1) + (side2 * side2));
    return h;
}
  
// Driver code
int main()
{
    int side1 = 3, side2 = 4;
    cout << fixed << showpoint;
    cout << setprecision(2);
    cout << findHypotenuse(side1, side2);
}
      
// This code is contributed by
// Surendra_Gangwar

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation of the approach
class GFG {
  
    // Function to return the hypotenuse of the
    // right angled triangle
    static double findHypotenuse(double side1, double side2)
    {
        double h = Math.sqrt((side1 * side1) + (side2 * side2));
        return h;
    }
  
    // Driver code
    public static void main(String s[])
    {
        int side1 = 3, side2 = 4;
        System.out.printf("%.2f", findHypotenuse(side1, side2));
    }
}

chevron_right


Output:

5.00


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.



Improved By : SURENDRA_GANGWAR



Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.