Line Clipping(Cohen Sutherland) C++ code free download

Given below is the C code for Cohen Sutherland Line clipping algorithm.
//Cohensutherland line clip BY ADITYA MANDHARE #include<iostream.h> #include<conio.h> #include <graphics.h> #include <stdlib.h> #include <stdio.h> #include <conio.h> #include<dos.h> float getx(float); float gety(float); void allocate(float x,float y,int n); int checkbothzero(int a[],int b[]); int checknotzero(int a[],int b[]); float x1,y1,x2,y2; float m; int a[4]={0,0,0,0}; int b[4]={0,0,0,0}; void main() { int gdriver = DETECT, gmode; initgraph(&gdriver, &gmode, ""); cout<<"\t\t\t*****COHEN SUTHERLAND LINE CLIPPING*****"; cout<<"\nEnter the starting and end co-ordinates of line"; cout<<"\nstart co-ord(x,y)"; cin>>x1>>y1; cout<<"end co-ord(x,y)"; cin>>x2>>y2; m=((y2-y1)/(x2-x1)); line(x1,y1,x2,y2); rectangle(100,200,300,100); delay(2000); cleardevice(); delay(1000); int flag=1; int select; do { int l; /* cout<<"values1"; for( l=0;l<4;++l) cout<<" "<<a[l]; */ /* cout<<"values2"; for( l=0;l<4;++l) cout<<" "<<b[l];*/ int i; int val; select=0; allocate(x1,y1,1); allocate(x2,y2,2); if(checkbothzero(a,b)) break; if(checknotzero(a,b)) { flag=0; break; } for(i=3;i>=0;--i) { if(a[i]==0 && b[i]==0) continue; else { val=i; break; } } if(a[val]==1) select=1; else select=2; if(val==3) { if(select==1) { x1=100; y1=gety(x1); } else { x2=100; y2=gety(x2); } } if(val==2) { if(select==1) { x1=300; y1=gety(x1); } else { x2=300; y2=gety(x2); } } if(val==1) { if(select==1) { y1=200; x1=getx(y1); } else { y2=200; x2=getx(y2); } } if(val==0) { if(select==1) { y1=100; x1=getx(y1); } else { y2=100; x2=getx(y2); } } } while(1); rectangle(100,200,300,100); if(flag==0) cout<<"Line is completely outside"; else { cout<<"Clipped line is as follows"; setcolor(RED); line(x1,y1,x2,y2); } getch(); cleardevice(); } float getx(float y) { float x; x=(((y-y1)/m)+x1); return x; } float gety(float x) { float y; y=(((x-x1)*m)+y1); return y; } void allocate(float x,float y,int n) { for(int i=0;i<4;++i) { if(n==1) a[i]=0; else b[i]=0; } if(x<100) { if(n==1) a[3]=1; else b[3]=1; } if(x>300) { if(n==1) a[2]=1; else b[2]=1; } if(y<100) { if(n==1) a[0]=1; else b[0]=1; } if(y>200) { if(n==1) a[1]=1; else b[1]=1; } } int checkbothzero(int a[],int b[]) { for(int k=0;k<4;++k) { if((a[k]+b[k])>0) return 0; } return 1; } int checknotzero(int a[],int b[]) { for(int k=0;k<4;++k) { if(a[k]+b[k]==2) return 1; } return 0; }