" The time required to solve this type of algorithm is equal to a times T of n over b plus some function f of n; the run time can then be solved based on where the latter function falls in the three cases of the master theorem.
The performance of this type of algorithm tends to not depend on cache size, making them "cache oblivious." The time required to solve this type of algorithm is equal to a times T of n over b plus some function f of n; the run time can then be solved based on where the latter function falls in the three cases of the master theorem. Algorithms of this type include the Cooley-Tukey algorithm for calculating the fast Fourier transform and Strassen's algorithm for matrix multiplication. A sorting algorithm that makes use of this strategy uses a pivot value; that algorithm is quicksort. Prototypical examples of these algorithms include binary search and merge sort. For 10 points, name this recursive algorithmic strategy of solving large problems by breaking them into smaller problems and combining the solutions.
The performance of this type of algorithm tends to not depend on cache size, making them "cache oblivious.
divide and conquer algorithms [or d-and-c algorithms; prompt on recursive algorithms]