maybe
jgfujtf
Write an algorithm to find the root of quadratic equation
By dividing
TO find the sum of n numbers?
Yes, please do.
Yes. But why?
If you use methods based on prime factors, it is the same whether you have 2, 3, or more numbers: find all the factors that occur in any of your numbers. If you use a method based on Euclid's Algorithm (that is, lcm(a, b) = a x b / gcf(a, b), where you find the gcf with Euclid's Algorithm), then you can find the lcm for two numbers at a time. For example, to get the lcm of four numbers, find the lcm of the first two, then the lcm of the result and the third number, than the lcm of the result and the fourth number.
To find the product of 323 and 133 using Euclid's algorithm, we first note that Euclid's algorithm is typically used to find the greatest common divisor (GCD) of two numbers rather than their product. However, the product of 323 and 133 is simply 42,919. If you were looking to apply Euclid's algorithm, you would use it to find the GCD first, which can then be used to derive other relationships between the numbers, but it does not directly provide the multiplication result.
Write an. Algorthim. To. Find the. Sum. Of. First15 natural. Numbers
There is no specific Hard and Fast rule for writing algorithm. The normal method is the following: 1. get a problem 2. find or invent an algorithm to solve it 3. implement the algorithm in a programming language (C, for example)
to find area and perimeter of a rectangle
Such an algorithm is called a 'God algorithm', from the fact that it would only be known by god/the gods. Although many have tried to find it, none have so far discovered it (assuming it exists). To solve a cube by algorithm, you need to know the appropriate algorithm to apply and when in the stages of solving; different sets can use large numbers of algorithm.