How to analyze complexity of selection and insertion sort algo

#1

Can i know the procedure which is followed to analyze them.

#2

You have to find relation between input size and number of iteration you do in worst case.So , for selection sort you find minimum in each iteration ,it might take n iteration to find the min element if it is present at the end of the array.Also,you have to find min n times.
So complexity O(n^2) ie.n*n

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.