Question

1 > Explain the best case, average case, and worst-case time complexities for the insertion of a new element in an array of size n by taking a suitable example. 2 > Write an algorithm to sort first Kth elements in non-decreasing order from the array of n elements by applying Selection sorting. Explain all the steps of your algorithm by taking an example of an array of size 10. Example: Input: 5 2 3 2 1 7 k = 4 n = 6 Output: 2 2 3 5 1 7

Answer 1

Answer:

hiiiiiiiiiiiiiiiiiiii dear

what's up

Explanation:

follow me

MARK me BRAINLIEST