Question

time complexity of selection sort in C language ​

Answer 1

Answer:

the answer is

Explanation:

So the complexity of the selection sort algorithm is O(n)*O(n) I.e. O(n^2).Here all three complexity will be the same .In the best case ,we consider as a array is already sorted .But u find out the smallest element ,we need to iterate and check for all the elements in the array.

hope it's helpful

PLSS MARK ME AS BRAINLIST AND THANK ME PLSS