Suppose that we have a set of activities to schedule among a large number of lecture halls, where any activity can take place in any lecture hall. We wish to schedule all
the activities using as few lecture halls as possible. Give an efficient greedy
algorithm to determine which activity should use which lecture hall. Find the time
complexity of this algorithm.

hello from mrbilldoesmath!

answer:

x - 3

discussion:

x^2 - 9 = (x-3) (x+3)   so

(x^2-9)/ (x + 3) = x-3

you,

mrb

-2

7 - 9 = -2

reversed:

-2 + 9 = 7

c.

step-by-step explanation:

she should of added 9^2 and 12^2. that is because it is a^2+b^2=c^2. c^2 is the hypotenuse and should always be bigger than the other two numbers. which is why she should of added 9 squared and 12 squared together instead of 15 squared.

ιт ιѕ 6 6/23

step-by-step explanation:

нσρє ι ¢συℓ∂ нєℓρ уσυ συт