Time and space complexity

#1

can you explain time and space complexity as well for these sorting techniques

#2

@vikassri in worst case two loops will run fully so time n square and space will always be o(1) (excluding the array space) as you are not considering any other array

#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.