Skip to main content

What is Divide And Conquer Technique

Divide and Conquer is a programming technique which makes the program more efficient to write. And this technique work on the concept of recursion to solve a problem step by step. Generally this technique work in three parts:- Divide:-  Divide the problem into some subproblem. Conquer:-  Conquer the subproblem by calling recursively until subproblem solved. Combine:-  (Optional Step) Combine the subproblem solution. So, that we will get the final problem Solution.  When the subproblems are large enough to solve recursively, we call the recursive case. Once the subproblem becomes small enough that we no longer recursive, we say that the recursion "bottom out" and that we have gotten down to the base case.                          Application of Divide and Conquer Quick Sort Strassen's algorithm for matrix multiplication Merge Sort Counting inversions Binary Search Finding Min and ...
1 comment

What is Divide And Conquer Technique

Divide and Conquer is a programming technique which makes the program more efficient to write.
And this technique work on the concept of recursion to solve a problem step by step.
Generally this technique work in three parts:-
  1. Divide:- Divide the problem into some subproblem.
  2. Conquer:- Conquer the subproblem by calling recursively until subproblem solved.
  3. Combine:- (Optional Step) Combine the subproblem solution. So, that we will get the final problem Solution. 
When the subproblems are large enough to solve recursively, we call the recursive case. Once the subproblem becomes small enough that we no longer recursive, we say that the recursion "bottom out" and that we have gotten down to the base case.
                        

Application of Divide and Conquer

  1. Quick Sort
  2. Strassen's algorithm for matrix multiplication
  3. Merge Sort
  4. Counting inversions
  5. Binary Search
  6. Finding Min and max

Divide and Conquer Abstract Algorithm

DAC(a,i,j)
{        
          //small(a,i,j) represent the smallest subproblem which can't be further divided
          if(small(a,i,j))  
                //solution(a,i,j) return some constant value
               return(solution(a,i,j));
           else
            {
                 //Divide(a,i,j) represent the dividing of large problem into small
                 mid=Divide(a,i,j);
                 b=DAC(a,i,mid);
                 c=DAC(a,mid+1,j);
                 //combine(b,c) represnt merging up of small subproblem
                 d=combine(b,c);
                  return d;
              }
}
                            

About Complexity of Abstract Divide & Conquer Algorithm

small(a,i,j)            having O(1) time complexity
solution(a,i,j)        having O(1) time complexity
Divide(a,i,j)          having some constant C1 time complexity
b=DAC(a,i,mid);  having T(n/2) time complexity
c=DAC(a,i,mid);  also having T(n/2) time complexity
combine(b,c)         having some constant C2 time complexity

The total time complexity of Divide and Conquer
      T(n)=O(1)   if n is small
      T(n)=C1+T(n/2)+T(n/2)+C2   if n is large

assuming C=C1+C2
Then,
         T(n)=2T(n/2)+C     //for two equal subproblem cost

And for 'a' equal subproblem of size 'b'
           T(n)=aT(n/b)+C     //It also depict that Divide and Conquer can be solved by Master's Theorem

Important Points about Divide & Conquer

  1. Function calling occur in Preorder
  2. Execution of function happen in Postorder














Comments

Post a Comment

Popular posts from this blog

POLYGON FORMATION IN C

                       /*  POLYGON FORMATION IN C  */ #include<stdio.h> #include<conio.h> #include<graphics.h> #include<stdlib.h> void main() {     int n,x[15],y[15],i;     printf("ENTER THE NUMBER OF SIDE OF POLYGON:\n");     scanf("%d",&n);     if(n<3)     { printf("POLYGON CAN'T BE FORM\n"); getch(); exit(0);     }     else     { for(i=1;i<=n;i++) { printf("ENTER THE CORDINATES OF THE POLYGON %d SIDE\n",i); scanf("%d %d",&x[i],&y[i]); } int gd=DETECT,gm; initgraph(&gd,&gm,"C:\\tc\\BGI"); for(i=1;i<n;i++) { line(x[i],y[i],x[i+1],y[i+1]); } line(x[1],y[1],x[n],y[n]); } getch(); }
1 comment
Read more

Bresenham circle drawing program in C

  /* This is the program for bresenham circle drawing  in C */ #include<stdio.h> #include<conio.h> #include<graphics.h> #include<dos.h> void main() { int gdriver = DETECT,gmode,x,y,r,x1,y1; float e; initgraph(&gdriver,&gmode,"C:\\tc\\BGI"); printf("center co-ordinate of x and y position of circle:\n"); scanf("%d %d",&x,&y); printf("input the radius of circle:\n"); scanf("%d",&r); x1=1; y1=r; putpixel(x+0,y+r,RED); putpixel(x+r,y+0,RED); putpixel(x-0,y-r,RED); putpixel(x-r,y-0,RED); e=3-2*r;   while(x1<y1) { if(e<0) { x1=x1+1; e=e+4*x1+6; } else { x1=x1+1; y1=y1-1; e=e+4*(x1-y1)+10; }           putpixel(x+x1,y+y1,1); putpixel(x+y1,y+x1,2); putpixel(x-x1,y+y1,3); putpixel(x-y1,y+x1,4); putpixel(x-x1,y-y1,5); putpixel(x-y1,y-x1,6); putpixel(x+x1,y-y1,7); putpixel(x+y1,y-x1,8); delay(100); } getch(); } /*NOTE:-You have to change the graphics...
Post a Comment
Read more