Consider sorting n numbers stored in array a by first finding the smallest element of a and exchanging it with the element in . then find the second smallest element of a and exchange it with . continue in this manner for the first − 1 elements of a. write pseudo-code for this algorithm, which is known as selection sort. what loop invariant does this algorithm maintain? why does it need to run for only the first − 1 elements, rather than for all n elements? give the best-case and worst-case running times of selection sort in θ-notation

can i get the link to the assignment?

step-by-step explanation:

6.9

step-by-step explanation:

simple math really

6 1/2 times 0.6 = 3.9

but if you are just doing 6 and not 6 1/2 then the answer is 3.6

i need the options

step-by-step explanation:

x = ±sqrt(10)

step-by-step explanation:

5 - 2x² = -15

subtract 5 from each side

5-5 - 2x² = -15-5

-2x^2   = -20

divide by -2 on each side

-2x^2   /-2= -20/-2

x^2 =10

take the square root on each side

sqrt(x^2 )=±sqrt(10)

x = ±sqrt(10)

check:

5 - 2x² = -15

+sqrt(10)

5 - 2(sqrt(10))² = -15

5 -2(10) = -15

5 -20 = -15

-15 = -15

-sqrt(10)

5 - 2(-sqrt(10))² = -15

5 -2(10) = -15

5 -20 = -15

-15 = -15