About this document
Recurrence Relations and Complexity Analysis by zayn alabidin is a document available to read on EtoBox.
The document discusses algorithms for finding the median of two sorted arrays. It proposes a recursive algorithm that partitions the arrays into halves at each step until base cases are reached. For the case when the arrays have equal length n, the running time satisfies the recurrence T(n) = T(n/2) + k, which solves to O(log n).
- Author
- zayn alabidin
- Language
- EN