# recurrence relations

See attached file.

Here are some recurrence relations that come up in the analysis of Quicksort and or Select. For each recurrence, write one sentence explaining how it relates to Quicksort or Select and give its asymptotic growth rate in notation.

A. T(n) = T(n/10) + T(9n/10) + n

B. T(n) = T(n-1) + n

C. T(n) = T(n/5) + T(3n/4) + n...

https://brainmass.com/computer-science/files/recurrence-relations-quicksort-select-19526

#### Solution Preview

a. Partition guarantees that there are at least n/10 elements less than the pivot and n/10 elements greater than the pivot. The solution is (nlgn).

b. This is ...

#### Solution Summary

The solution examines recurrence relations.

$2.19