July 2018
Beginner
202 pages
5h 4m
English
The master method provides a way to solve recurrences of the following form:
Where: a >= 1 and b > 1 are constants, f(n) is an asymptotically positive function
The master method consists of three cases, which will allow you to solve these kind of recurrences quite easily. Before we delve into these three cases, it is important to note that the recurrence is not actually well defined, since n/b may not be an integer. Whether we replace it with the floor or ceiling of the n/b division will not affect the asymptotic behavior of the recurrence.
The big O notation describes the asymptotic upper bound of the growth rate of a function. There are also other notations to describe bounds on the growth rate of ...
Read now
Unlock full access