The recurrence T(n) = 7T(n/2)+n2 describes the running time of an algorithm ALG. A competing algorithm ALG  has a running time of T (n) = aT (n/4)+  n2 log n. What is the largest value of a such that ALG is asymptotically faster than ALG?

geometry: triangles

solvers

lessons

answers archive

call the larger triangle abc

then the smaller triangle cde is similar to abc (all angles are equal, aaa).  

ab is the side that is 36, and we wish to find de, the side corresponding to ab

area_cde = area_abc - area_cde --> area_abc / area_cde = 2

let x=length of de

ratio of areas = (ratio of sides)^2

+2+=+%2836%2fx%29%5e2+

+2+=+1296%2fx%5e2+

++x%5e2+=+1296%2f2+=+648+

25.45584

-12 > a

step-by-step explanation:

-11 > 1 + a

subtract 1 from each side

-11 -1> 1 -1+ a

-12 > a

hope this !

let me know