In my slides for my algorithms class, I have a method of finding the complexity of recursive functions called Recurrence Relation with "partizione bilanciata" which means "balanced partition".
My course is in Italian and looking online in English I could not find any trace of this method, I know of the recursive tree, induction, and master theorem.
Has anyone any idea of how this is called in English? I don't like studying in Italian and I do not understand those pdfs.
I'm attaching some images of the formulas.
What exactly "balanced partition" mean, does it have something to do with for example Quick Sort, when you choose a middle pivot and the partitions are equal in size, which means it's balanced?
Is it the same as master theorem written maybe in a different way? I can see the form of the recurrence relation is different than the master theorem:
The master theorem has $f(n)$ instead of $cn^\beta$.