Java: Count the number of possible triangles from a given unsorted array of positive integers
Write a Java program to count the number of possible triangles from a given unsorted array of positive integers.
Note: The triangle inequality states that the sum of the lengths of any two sides of a triangle must be greater than or equal to the length of the third side.
Sample Solution:
Java Code:
Sample Output:
Original Array : [6, 7, 9, 16, 25, 12, 30, 40] Total number of triangles: 17
Flowchart:
Java Code Editor:
Previous: Write a Java program to find all combination of four elements of a given array whose sum is equal to a given value.
Next: Write a Java program to cyclically rotate a given array clockwise by one.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics