An array s[..] stores n distinct numbers such that the first k numbers are smaller than x and the other numbers are larger than x (x a real number). suppose that insertionsort is used to sort s. the number of shifts t made by insertionsort depends on s. find the largest value of t as a function of n and k. argue why.

huh? im pretty sure it is in 199

step-by-step explanation:

from the figure we get,

the x axis shows   the months and,

the y-axis shows the number of satisfied customer.

each line or each cell in upward direction (y-axis) shows 500.

the appropriate scale for the y - axis is: -

a = 2000 customers

b = 4000 customers

c = 6000 customers

d = 8000 customers

e = 10000 customers

f = 12000 customers

g = 14000 customers

step-by-step explanation:

se a cavasery6