such as optimal subsampling algorithms and divide and conquer algorithms. In contrast to the optimal subsampling algorithm, which samples small-scale, informative data points, the divide and ...

We have seen examples of divide and conquer algorithms in previous courses, such as mergesort and quicksort algorithms. We will study more algorithms that fit this design paradigm. We will study Fast ...

sorting algorithms, recurrence relations, divide and conquer algorithms, greedy algorithms, dynamic programming, linear programming, graph algorithms, problems in P and NP, and approximation ...