Show that any array of integers x[1. N] can be sorted in o(n m) time, where m = max i xi −min i xi for small m, this is linear time: why doesn’t the ω(nlogn) lower bound apply in this case?.

diagram is missing, but i will try to explain your doubt.

answer:

amplitude is the maximum displacement or distance moved on a point of a vibrating body or wave measured from its equilibrium position.it is equal to half the length of vibration path.

here we know that ball will drop down by total distance 3.2 m

so here we know that

now using kinematics

now in the same time it will cover horizontal distance of 0.75 m

so speed of the ball will be

your answer is c! hope this : )

when two balls of the different masses are dropped from equal height, they reach the ground at the same time .this is because they experience the same acceleration.

the acceleration is independent of mass.

thus when they are dropped they will always maintain the same velocity and travel the same distance (neglect air resistance of course) at the same time.