Describe an algorithm that takes as input a list of n distinct integers and finds the location of the largest even integer in the list or returns 0 if there are no even integers in the list.

step-by-step explanation:

dong do iy iys a scram

3

step-by-step explanation:

median is the value separating the higher half of a data sample, a population or probablity distribution from the lower half.

step-by-step explanation:

say you have 3,8,7,3,1,9,8 order them from lowest to highest

if orderd it would be 1,3,3,7,8,8,9 now you take away from the lowest and the highest until you end up in the middle.

so you would remove the 1 and 9 leaving you with 5 digits remaining

when you've reached the middle that would be your answer so in this case the answer is 7

if there were two numbers left say 7 and 5 you'd and them together so 12 then divide by 2 witch would equal 6 so the answer would be 6

good luck on that project hoped i you at all