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 max Divide and Conquer Abstract Algorithm DAC(a,i,j) {   
1 comment

BUBBLE SORTING WITH GRAPHICAL REPRESENTATION

/*BUBBLE SORTING WITH GRAPHICAL REPRESENTATION*/
#include<stdio.h>
#include<conio.h>
#include<graphics.h>
#include<dos.h>
void object(int,int,int);
void bubble(int);
void flow(int,int);
void mixing(int,int);
int a[10];
void main()
{
 int n,i,gd=0,gm=0;
 clrscr();
 printf("Enter the No of Elements : " );
 scanf("%d",&n);
 for(i=0;i<n;i++)
 {
  printf("Enter the %d Element : ",i+1);
  scanf("%d",&a[i]);
 }
 initgraph(&gd,&gm,"c://tc//bgi");
 settextstyle(3,0,1);
 outtextxy(250,50,"GIVEN NUMBER");
 for(i=0;i<n;i++)
 {
  object(100+i*50,150,a[i]);
  getch();
 }
 bubble(n);
/* for(i=0;i<n;i++)
 {
  object(100+i*50,350,a[i]);
  getch();
 }*/delay(500);
 settextstyle(3,0,2);
 outtextxy(400,400,"prepared by rishabh");
 getch();
}
void bubble(int n)
{
 int i,j,temp;

  for(i=0;i<n;i++)
  for(j=i;j<n-1;j++)
   if(a[i]>a[j+1])
   {
    flow(i,j+1);
    temp=a[i];
    a[i]=a[j+1];
    a[j+1]=temp;
   }
}
void object(int x,int y,int no)
{
 char s[8];
 sprintf(s,"%d",no);
 circle(x,y,15);
 settextstyle(2,0,6);
 outtextxy(x-3,y-10,s);
}
void flow(int f,int s)
{
 int i;
 for(i=0;i<50;i++)
 {
  setcolor(WHITE);
  object(100+f*50,150+i*4,a[f]);
  delay(15);
  setcolor(0);
  object(100+f*50,150+i*4,a[f]);
 }
 setcolor(WHITE);
 object(100+f*50,150+i*4,a[f]);
 for(i=0;i<50;i++)
 {
  setcolor(WHITE);
  object(100+s*50,150+i*4,a[s]);
  delay(10);
  setcolor(0);
  object(100+s*50,150+i*4,a[s]);
 }
 setcolor(WHITE);
 object(100+s*50,150+i*4,a[s]);
 mixing(f,s);
 for(i=50;i>0;i--)
 {
  setcolor(WHITE);
  object(100+f*50,150+i*4,a[s]);
  delay(10);
  setcolor(0);
  object(100+f*50,150+i*4,a[s]);
 }
 setcolor(WHITE);
 object(100+f*50,150+i*4,a[s]);
 for(i=50;i>0;i--)
 {
  setcolor(WHITE);
  object(100+s*50,150+i*4,a[f]);
  delay(15);
  setcolor(0);
  object(100+s*50,150+i*4,a[f]);
 }
 setcolor(WHITE);
 object(100+s*50,150+i*4,a[f]);
}
void mixing(int f,int s)
{
 int i;
 for(i=0;i<(s-f)*50;i++)
 {
  setcolor(WHITE);
  object(100+f*50+i,350,a[f]);
  object(100+s*50-i,350,a[s]);
  delay(20);
  setcolor(0);
  object(100+f*50+i,350,a[f]);
  object(100+s*50-i,350,a[s]);
  }
  setcolor(WHITE);
  object(100+f*50+i,350,a[f]);
  object(100+s*50-i,350,a[s]);

}


Labels:

Comments

Post a Comment

Popular posts from this blog

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 max Divide and Conquer Abstract Algorithm DAC(a,i,j) {   
1 comment
Read more

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