Divide and Conquer - Decrease and conquer
3 important questions on Divide and Conquer - Decrease and conquer
Decrease by a constant
The size of an instance is reduced by the same constant on each iteration of the algorithm.
Decrease by a constant factor
This technique suggests reducing a problem instance by the same constant factor on each iteration of the algorithm
Variable size decrease
The size-reduction pattern varies from one iteration of an algorithm to another. Example: Euclid's algorithm for the greatest common divisor.
The question on the page originate from the summary of the following study material:
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding
Remember faster, study better. Scientifically proven.
