Divide and Conquer 1
Monday, September 21,2020 11:24AM
Divide and Conquer Design Paradigm
‘This Design paradigm involves three steps:
HERE « problem into a number of subproblems
MER the solutions of the subproblems by solving them
MEIER the solutions of the subproblems to get the solution of the original one.
Example 1: Binary search
Problem Statement: Given a sequence of n sorted elements, stored in an array A
such
that A[1] < A] < A[3]< ...... 1) then output" ais not present in the list" and terminate
else
if (a[[I] <0) then
output "The clement is present in the list at index |"
else
if (@