Quickselect Algorithm with Partitioning | Python Code

[@baazzzzz2505]

finally found best explanation after 3 hours

[@urrahman196]

Partition fn has complexity - O(n), other function is also using recursion, then how to calculate the complexity for recursion?

[@dikshachaudhary9682]

Can you please explain how is the complexity O(n) because the partition function is only taking O(n) time and then what about the recursive call

[@rsKayiira]

Its supposed to be Nlogn but since you you go only one way during recursion, it reduces it to a decreasing geometric series.

[@ankurvarshney2218]

Nice tutorial 👍

[@nETSETOStECH]

Thank you! Cheers!