Sunday, February 10, 2019

insert image in graphics c++

#include<graphics.h>
#include<conio.h>
int main()
{
int gmode= DETECT ,gm;
initgraph(&gmode,&gm,"c://tc//bgi");
readimagefile("saad.jpg",100,100,300,300);// use your pic name instead of saad and save your pic //and code in same folder.......
getch();
closegraph();
}

                   output

insert picture in c/c++

Tuesday, January 22, 2019

bubbles using graphics

bubbles in using graphics





#include<graphics.h>
#include<conio.h>
int main()
{

    int gmode=DETECT ,gm;
    initgraph(&gmode,&gm,"c://tc//bgi");
    cleardevice();
int i,j,k=5;
while(1)
{
   for(i= 200,j=1;i>1,j<=200;i--,j++)
{



 setcolor(10);
 //circle(10,20+j,30+j);
  circle(100+i,100,30); // left to right
  setcolor(8);
  circle(100+i,200,30); // left to right
   setcolor(5);
  circle(100,200+i,30); // below to upper right corner
    setcolor(5);
  circle(100+i,200+i,30); // below to upper left corner
  setcolor(6);
  circle(100+i,100+i,30);
  setcolor(3);
  circle(10+i,0+i,30);
  setcolor(4);
  circle(100,100+i,30);
  setcolor(1);
  circle(100,100+j,30);
setcolor(2);
  circle(100+j,100,30);
  setcolor(2);
  circle(10+j,10+j,30);
   setcolor(11);
  circle(100+j,200+j,30);
  setcolor(12);
  circle(100+j,0+j,30);
  setcolor(13);
  circle(100+i,100+j,30);
  setcolor(14);
  circle(100+i,200+j,30);
  setcolor(15);
  circle(0+j,100+j,30);
 //line(100+j,100+j,200+j,300+j);

 delay(30);
 cleardevice();

}
}


getch();

}

Friday, January 18, 2019

graphics basic program to print star

pic showing star
graphics-star
#include<graphics.h>
#include<conio.h>
int main()
{
int gmode= DETECT ,gm;
        initgraph(&gmode,&gm,"c://tc//bgi");


int i;
while(1)
{
for(i=1;i<15;i++)
{
     cleardevice();

    setcolor(i);
    line(100,100,160,270);
line(160,270,230,100);
line(80,210,240,210);
line(100,100,240,210);
line(80,210,230,100);
delay(500);
}
}

getch();
closegraph();
}






Tuesday, November 6, 2018

Bubble Sort

#include<iostream>
using namespace std;
class bubblesort
{
int temp, array[],size;
public:
void sort(int array[],int size)
{

for(int i=0;i<size;i++)
{
for(int j=0;j<size-1-i;j++)
{
if(array[j]>array[j+1])
{
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
for(int j=0;j<size;j++)
 {
 cout<<array[j]<<" ";
 }
 cout<<endl;



}


};
int main()
{  bubblesort obj;

int size,array[size];
cout<<"enter array size"<<endl;
cin>>size;
cout<<" enter "<<size<<" element of array"<<endl;
for(int i=0;i<size;i++)
{

cin>>array[i];

}
obj.sort(array,size);

return 0;
}





Insertion Sort

#include<iostream>
using namespace std;
int main()
{
int size, a[100],temp,j,i;
cout<<"enter array size"<<endl;
cin>>size;
cout<<"enter array"<<endl;
for(i=0;i<size;i++)
{
cin>>a[i];
cout<<endl;
}
for(i=1;i<size;i++) // the zeroth index of this array sorting will remain untouch.
{
temp=a[i];
j=i-1;
while((j>=0)&& (a[j]>temp)) // if a[j](va,ue on zeroth index) have higher value than 1st index
{
a[j+1]=a[j];
j--;
}
a[j+1]=temp;
}
cout<<"sorted array"<<endl;
for(i=0;i<size;i++)
{
cout<<a[i]<<endl;
}
return 0;
 insertion sort
}

Selection sort

#include<iostream>
using namespace std;
class selectionsort
{
int temp, min,i,j;
public:
void sort(int array[])


for( i=0;i<5;i++)
{
min=i;
for( j=1+i;j<5;j++)
if(array[min]>array[j])
min=j;
if(min!=i)
{
temp=array[i];
array[i]=array[min];
array[min]=temp;
}



}
cout<<"\nthe sorted array"<<endl;
for(int i=0;i<5;i++)
{
cout<<array[i]<<" ";
}

        }   
};
int main()
{  selectionsort obj;

int array[100],i;
cout<<" enter  element of array"<<endl;
for( i=0;i<5;i++)
{
cout<<" enter value:";
cin>>array[i];
cout<<endl;

}
cout<<"\nthe original array is"<<endl;
for( i=0;i<5;i++)
{

cout<<array[i]<<"  ";

}
obj.sort(array);

return 0;
}