Answer:
No
Step-by-step explanation:
4,4,5 and 12,7,7 are isosceles triangles because they have two equal sides . 15,15,15 is an equilateral triangle -it has three equal sides
Answer:
The running time is quadratic (O(n²) )
Step-by-step explanation:
For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n), is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is
C + T(n) + n*(a*n+b) = an²+bn + T + C
Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).
the answer is on the page it is a screenshot explaining how to do it
Answer:
36 and 45
Step-by-step explanation:
7:44 is the answer to the Question