📘 algorithms

1. **State the problem:** We have a variant of the Median-of-Five algorithm where the input of size $n$ is partitioned into $\frac{n}{3}$ blocks each of size 3. 2. **Part (a): Deri

1. Problem statement: We analyze a complete binary tree T of size $n$ where the last level is filled from left to right.

1. **State the problem:** We analyze the Quick-Select algorithm's average-case time complexity when the "good case" pivot lies in the middle third of the array, i.e., $\frac{n}{3}

1. **Problem Statement:** We are analyzing the average-case time complexity of the Quick-Select algorithm.