Given a vector of lengths [a b c], determines whether a triangle with non-zero area (in two-dimensional Euclidean space, smarty!) could have sides of those lengths.
Examples:
[1 2 1000] ---> false
[3 4 5] ---> true
[5 5 5] ---> true
Solution Stats
Problem Comments
-
1 Comment
Gaik Tamazian
on 17 Feb 2012
Tests with sides that are not sorted should be added.
Solution Comments
-
1 Comment
Binbin Qi
on 25 Apr 2012
no range??
-
1 Comment
Peter Wittenberg
on 31 Mar 2012
I wanted to try out the Hankel here. This is more than necessary. It checks to see that the sum of all pairs of sides are greater than the remaining side. You really only need to do this to compare against the maximum length side.
-
3 Comments
Yvan Lengwiler
on 1 Mar 2012
This is just bad, only gaming the test suit. There is nothing to be learned from this.
MD. MASRUL HUDA
on 23 Jun 2012
worst solution ,i have ever seen
the cyclist
on 9 Mar 2013
Added to test suite to eliminate this "solution".
Recent Solvers457
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
11262 Solvers
-
3228 Solvers
-
Find state names that start with the letter N
448 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
239 Solvers
-
204 Solvers
More from this Author23
Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)