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.

part 1 answer = 8

part 2 answer = 72

step-by-step explanation:

part 1 explanation = add all of the numbers, then divide by how many numbers you have. so, 200/25 = 8.

part 2 explanation = not gonna lie, this is hard to explain, so just google how to do it.

d 25 pi/6

step-by-step explanation:

the diameter is 10 inches

the radius is 1/2 of the diameter or 5 inches

the area of the circle is

a = pi r^2

  = pi 5^2

  = 25 pi

the slice is 60 degrees of the entire circle.

60 degrees out of 360   60/360 = 1/6

the area of the slice is 1/6 of the circle

a slice = 1/6 a circle

a slice = 1/6 * 25 pi

the answer is:

the correct option:

b.

to solve the problem, we need to remember how to operate to simplify exponential expressions using the logarithms.

we are given the equation:

then, using placing logarith with base 7 on both sides of the equation, we have:

so, rounding the obtained result to two decimal places (nearest hundreth), we have:

hence, we have that the correct option:

b.

have a nice day!