How to find the big o running time if the recursion function have different cases of recursion...
Channel: Roel Van de Paar
Date: 01/03/2021

How to find the big o running time if the recursion function have different cases of recursion with different fraction of n?

Helpful?  Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user Programmer (cs.stackexchange.com/users/58751), user gnasher729 (cs.stackexchange.com/users/17408), user D.W. (cs.stackexchange.com/users/755), user dkaeae (cs.stackexchange.com/users/70382), and the Stack Exchange Network (cs.stackexchange.com/questions/105579). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com