0
#include<stdio.h> #include<conio.h> #include<math.h> #include<graphics.h> void draw_line(float,float,float,float); main() { int driver,mode; float x1,y1,x2,y2; clrscr(); printf("Enter the two endpoints of the line:"); printf("\nx1 ="); scanf("%f",&x1); printf("y1 ="); scanf("%f",&y1); printf("x2 ="); scanf("%f",&x2); printf("y2 ="); scanf("%f",&y2); clrscr(); driver = DETECT; initgraph(&driver,&mode,"\\tc\\bgi"); \\path of bgi can be different in your case draw_line(x1,y1,x2,y2); getch(); closegraph(); } void draw_line(float x1,float y1,float x2,float y2) { float dy,dx; float x,y; float p,p0,dp1,dp2; dy = y2-y1; dx = x2-x1; p0 = 2 * (dy - dx); dp1 = 2 * dy; dp2 = 2 * (dy - dx); putpixel(x1,y1,EGA_WHITE); p = p0; for(x=x1+1,y=y1;x<x2;x++) { if(p < 0) { p = p+dp1; putpixel(x,y,EGA_WHITE); } else { p = p+dp2; y++; putpixel(x,y,EGA_WHITE); } }
What else can I help you with?
Can you provide a solution to the diamond-square algorithm using Java and recursion?
Yes. It is possible to provide a solution to the diamond-square algorithm using Java and recursion.
What is the algorithm for determining the maximum of two numbers?
Compare two numbers, a and b. If a is greater than b then return a, otherwise return b. In C, we can implement this algorithm using the ternary operator (?:), as follows: return a>b?a:b;
What is the difference between implementation and algorithm?
An algorithm is a instruction for solving a problem. It is typically illustrated using prose, pseudo code or flowcharts, but other methods exist. The algorithm is the "here's how it's going to work" part of the solution. An implementation (of an algorithm) is a specific expression of this algorithm, using a specific programming language or any other suitable means. The implementation is the "here's how I've done it" part of the solution.
How do you RSA algorithm c?
Perform encryption on the following PT using RSA and find the CT p = 3; q = 11; M = 5
Time complexity of selection sort?
Merge sort (or mergesort) is an algorithm. Algorithms do not have running times since running times are determined by the algorithm's performance/complexity, the programming language used to implement the algorithm and the hardware the implementation is executed upon. When we speak of algorithm running times we are actually referring to the algorithm's performance/complexity, which is typically notated using Big O notation. Mergesort has a worst, best and average case performance of O(n log n). The natural variant which exploits already-sorted runs has a best case performance of O(n). The worst case space complexity is O(n) auxiliary.
What are the differences between bresenham's and midpoint circle algorithm?
Bresenham's algorithm is primarily used for drawing straight lines by determining which pixels to illuminate based on the line's slope, ensuring efficient computation with only integer operations. In contrast, the midpoint circle algorithm is designed for drawing circles by calculating pixel positions based on the circle's radius and using symmetry to minimize calculations. While both algorithms prioritize efficiency and simplicity, Bresenham's focuses on linear paths, whereas the midpoint circle algorithm addresses circular shapes.
What is the most efficient way to implement a factorial algorithm in a programming language?
The most efficient way to implement a factorial algorithm in a programming language is to use an iterative approach rather than a recursive one. This involves using a loop to multiply the numbers from 1 to the given input number to calculate the factorial. This method is more memory-efficient and faster than using recursion.
Can you provide a solution to the diamond-square algorithm using Java and recursion?
Yes. It is possible to provide a solution to the diamond-square algorithm using Java and recursion.
What steps are required to plot a line whose slope is between 0 Degree and 45 Degree using Bresenham's method?
To plot a line with a slope between 0 and 45 degrees using Bresenham's method, first identify the start and end points of the line. Calculate the differences in the x and y coordinates (dx and dy) to determine the slope. Since the slope is less than or equal to 1, iterate over the x-axis, incrementing x by 1 for each step, and calculate the corresponding y value using the slope. Adjust the y value based on the accumulated error to ensure the line is drawn accurately according to Bresenham's algorithm.
How do you sinx without using mathh or built in sin function Any Algorithm to implement sin function?
You can compute sin(x) manually/numerically using Taylor's Series.
How do you implement algorithm in layered approach using conditional random field intrusion detection?
if u having this project means mail to aravindramesh11@gmail.com
What is the algorithm for determining the maximum of two numbers?
Compare two numbers, a and b. If a is greater than b then return a, otherwise return b. In C, we can implement this algorithm using the ternary operator (?:), as follows: return a>b?a:b;
What is overstrike in bressenham's circle drawing algorithm?
Overstrike in Bresenham's circle drawing algorithm refers to the phenomenon where the algorithm draws pixels that do not accurately represent the intended circular shape. This can occur due to rounding errors or improper decision-making during the pixel selection process. The algorithm aims to minimize these inaccuracies by using integer arithmetic to determine the best pixels to draw based on the circle's mathematical properties. Proper implementation helps ensure that the drawn circle closely approximates a true circle on a raster display.
What the difference between algorithm and pseudocode?
An algorithm is a description of a method for accomplishing some task. For example, an algorithm for driving to a friend's house could be:1. Find your keys2. Get into the car3. Start the engine4. Put transmission into gearetc...Psuedocode is an implementation of an algorithm in a code-like format. For example, the above algorithm in psuedocode could look something like:while(keys.location != "in your hand"){search_for_keys();}walk_to_car();if(car.door == locked)car.door.unlock();engine.start();...An algorithm describes the steps required to solve a problem. Algorithms are written using natural language (e.g., English).Pseudocode is a human-readable version of an algorithm written using an informal language that is very similar to a programming language but which can be more easily translated into any specific programming language.
What is the difference between implementation and algorithm?
An algorithm is a instruction for solving a problem. It is typically illustrated using prose, pseudo code or flowcharts, but other methods exist. The algorithm is the "here's how it's going to work" part of the solution. An implementation (of an algorithm) is a specific expression of this algorithm, using a specific programming language or any other suitable means. The implementation is the "here's how I've done it" part of the solution.
How do you run graphics program in C?
pro c language to implement linear search using pointers
What is the difference between an algorithm and a program?
An algorithm is a step-by-step procedure for solving a problem, while a program is a set of instructions written in a programming language that implements an algorithm to perform a specific task on a computer. In simpler terms, an algorithm is like a recipe, and a program is like the dish you make using that recipe.
