selection sort algorithm time complexity
In selection sort the outer loop time complexity will be O(n)
and the inner loop time complexity will be (n(n-1))/2
then why have we added outer loop time complexity with inner loop : n + (n(n-1))/2
instead of multiplying?