Give a brute-force algorithm that finds the second largest element in a list a1, a2, an (n ≥ 2) of distinct integers by finding the largest element, placing it at the beginning of the sequence, then finding the largest element of the remaining sequence slader

the inequality is:

250c+180g≥950

step-by-step explanation:

let c denotes the number of days in a week   miyoko worked as a cryptographer.

and g denotes the number of days in a week she works as a geologist.

now we are given that she earns $250 for every day she works as a cryptographer,and earns $180 for every day she works as a geologist.

now miyoko's goal is to earn more than $950 this week.

hence, the inequality could be represented as:

250c+180g≥950

answer: the distance

step-by-step explanation:

to calculate the distance d of a line segment with endpoints (x1, y1) and (x2, y2) use the formula d (x2 x1)2 (y2 y1)2. to calculate the midpoint of a line segment with endpoints (x1, y1) and (x2, y2) use the formula

explanation:

infrared radiation has wavelength in the range between 700 nm and 1 mm. lets' convert these values into scientific notation, keeping in mind that:

let's start from the lower value, we have:

(we moved the dot two places to the left, so we increased the exponent by 2 units, from -9 to -7)

the higher value is:

so, the range of wavelength of infrared radiation is: