Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in AŒ1. Then find the second smallest element of A, and exchange it with AŒ2. Continue in this manner for the first n1 elements of A. Write pseudocode 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 n 1 elements, rather than for all n elements? Give the best-case and worst-case running times of selection sort in ‚-notation.

a variable of array type holds a reference of object

array are commonly used in computer program to organize data so that a related set of values

array are using zero base indexing it start with 0.

all component of array have same type, two different types doesn't use in single array

if array are store 10 quantities its index value varies from 0 to 9.

it stores 1st quantity value in index value 0 and this process will same till index value 9.

power left de cliffs or inoonsw

the correct answer is: a.)it is never appropriate to use acronyms and emoticons in business communication.