Algorithm for sum 2+4+6+….+n
1 answer:
You might be interested in
Answer:
Check the explanation
Explanation:
Points to consider:
We need to take the input from the user
We need to find the manhatan distance and euclidian using the formula
(x1, y1) and (x2, y2) are the two points
Manhattan:
Euclidian Distance:
Code
#include<stdio.h>
#include<math.h>
struct Point{
int x, y;
};
int manhattan(Point A, Point B){
return abs(A.x - B.x) + abs(A.y- B.y);
}
float euclidean(Point A, Point B){
return sqrt(pow(A.x - B.x, 2) + pow(A.y - B.y, 2));
}
int main(){
struct Point A, B;
printf("Enter x and Y for first point: ");
int x, y;
scanf("%d%d", &x, &y);
A.x = x;
A.y = y;
printf("Enter x and Y for second point: ");
scanf("%d%d", &x, &y);
B.x = x;
B.y = y;
printf("Manhattan Distance: %d\n", manhattan(A, B));
printf("Euclidian Distance: %f\n", euclidean(A, B));
}
Sample output
Answer:
See explaination and attachment.
Explanation:
Iteration method is a repetitive method applied until the desired result is achieved.
Let the given equation be f(x) = 0 and the value of x to be determined. By using the Iteration method you can find the roots of the equation. To find the root of the equation first we have to write equation like below
x = pi(x)
Let x=x0 be an initial approximation of the required root α then the first approximation x1 is given by x1 = pi(x0).
Similarly for second, thrid and so on. approximation
x2 = pi(x1)
x3 = pi(x2)
x4 = pi(x3)
xn = pi(xn-1).
please go to attachment for the step by step solution.
