Technoworlds

Circular Linked List

#include <stdio.h> #include <stdlib.h> // Structure for a node struct Node { int data; struct Node* next; }; // …

byBhavesh

Binary Search Method

#include <stdio.h> #include <stdlib.h> struct node {    int data;    struct node *leftChild, *rightChild; }; str…

byBhavesh

DFS And BFS Traversal

#include <stdio.h> #include <stdlib.h> // Define the maximum number of vertices in the graph #define MAX_VERTICE…

byBhavesh

BST Operation

#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *leftChild, *rightChild; }; str…

byBhavesh

Bit Map Algorithm

#include<stdio.h> #include<conio.h> #include<graphics.h> #include<math.h> int main() {     int x,y,i…

byBhavesh

Boundary Fill Algorithm

#include<stdio.h> #include<conio.h> #include<graphics.h> #include<math.h> #include<dos.h> voi…

byBhavesh

Bezier Curve

#include<graphics.h> #include<math.h> #include<conio.h> #include<stdio.h> void main() { int x[4],y[…

byBhavesh

koch curve

#include<stdio.h> #include<graphics.h> #include<conio.h> #include<math.h> void koch(int x1, int y1, …

byBhavesh

Rotation

#include <stdio.h> #include <conio.h> #include <graphics.h> #include <math.h> void DrawRect(int x1,…

byBhavesh

Scalling

#include <stdio.h> #include <conio.h> #include <graphics.h> #include <process.h> #include <math.h…

byBhavesh

Translation

#include<graphics.h> #include<stdio.h> #include<conio.h> #include<dos.h> int main(){     int gd = DE…

byBhavesh

Animation Drawing Ball part2

#include<conio.h> #include<graphics.h> #include<dos.h> void main() { int i,gd,gm; detectgraph(&gd,&…

byBhavesh

Animation Drawing Ball

#include<conio.h> #include<graphics.h> #include<dos.h> void main() { int i,gd,gm; detectgraph(&gd,&…

byBhavesh

Mid Point circle Drawing Algorithm

#include<stdio.h> #include<conio.h> #include<graphics.h> #include<dos.h> #include<math.h> void…

byBhavesh

Flood Fill 4 connected Algorithm

#include<graphics.h> #include<stdio.h> #include<conio.h> void flood(int x, int y, int new_col, int old_co…

byBhavesh

Flood Fill 8 connected Algorithm

#include<graphics.h> #include<stdio.h> #include<conio.h> void flood(int x, int y, int new_col, int old_col…

byBhavesh

Ellipse Algorithm

#include<conio.h> #include<stdio.h> #include<graphics.h> void main() {  int gd=DETECT,gm;  float x,y,xc,yc…

byBhavesh

Bresenham Dot Algorithm

#include<stdio.h> #include<conio.h> #include<graphics.h> #include<dos.h> #include<math.h> void…

byBhavesh

Bresenham Line Algorithm

#include<stdio.h> #include<conio.h> #include<graphics.h> #include<dos.h> #include<math.h> void…

byBhavesh

DDA Dot Algorithm

#include<stdio.h> #include<conio.h> #include<graphics.h> #include<dos.h> #include<math.h> void…

byBhavesh