enter image description here
I should solve the time Complexity method like this photo but I have a problem solving it for selectio sort.
I solved it in general and not in detail like I wanted going to know the solution method and not just like (T(n)= O(n-1)+..+1. I want it to be step by step how we reached this answer and how we produced the time (O(n^2)).
This is the code that I made through which I want to know the time complexity:
package example;