Quick sort algorithm

#1

time complexity jab nikal rhe h to partition me constant time kaise lag rha h.partion me bhi to loop h na???

#2

Yes the partition is O(n) thats why time complexity in average case is T(n) = 2 * T(n/2) + O(n), the O(n) in the end comes from the partition itself

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