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

Given: ∆mop p∆mop =12+4 3 m∠p = 90°, m∠m = 60° find: mp, mo

Nthe opening scene of the movie raiders of the lost ark, indiana jones replaces a golden statue with a bag of sand. the platform on which the statue is placed is designed to detect the mass of the statue. if the bag of sand has a different mass than the statue, then a mechanism triggers and destruction ensues. the density of gold is about 20\text{ g/cm}^320 g/cm 3 20, space, g, slash, c, m, start superscript, 3, end superscript. the density of sand can be estimated at 2.5\text{ g/cm}^32.5 g/cm 3 2, point, 5, space, g, slash, c, m, start superscript, 3, end superscript. the gold statue can be modeled as a cylinder with height 25\text{ cm}25 cm25, space, c, m and radius 8\text{ cm}8 cm8, space, c, m. in terms of \piπpi, what is the mass of sand indiana jones needs to avoid triggering the mechanism?

If on=8x-8,lm=7x+4,nm=x-5,and ol=3y-6