GCD USING WHILE LOOP IN C++

-

Find GCD using while loop

    

  1. #include <iostream>
    2. 

  2. using namespace std;
    3. 

  3. 

    4. 

  4. int main()
    5. 

  5. {
    6. 

  6.     int n1, n2;
    7. 

  7. 

    8. 

  8.     cout << "Enter two numbers: ";
    9. 

  9.     cin >> n1 >> n2;
    10. 

  10.     
    11. 

  11.     while(n1 != n2)
    12. 

  12.     {
    13. 

  13.         if(n1 > n2)
    14. 

  14.             n1 -= n2;
    15. 

  15.         else
    16. 

  16.             n2 -= n1;
    17. 

  17.     }
    18. 

  18. 

    19. 

  19.     cout << "HCF = " << n1;
    20. 

  20.     return 0;
    21. 

  21. }
    22.
Output
Enter two numbers: 78
52
HCF = 26

Comments

Post a Comment

Popular posts from this blog

Scan Converting a sStraight Line

-
Image
Scan Converting a Straight Line A straight line may be defined by two endpoints & an equation. In fig the two endpoints are described by (x 1 ,y 1 ) and (x 2 ,y 2 ). The equation of the line is used to determine the x, y coordinates of all the points that lie between these two endpoints. Using the equation of a straight line, y = mx + b where m = & b = the y interrupt, we can find values of y by incrementing x from x =x 1 , to x = x 2 . By scan-converting these calculated x, y values, we represent the line as a sequence of pixels. Properties of Good Line Drawing Algorithm: 1. Line should appear Straight: We must appropriate the line by choosing addressable points close to it. If we choose well, the line will appear straight, if not, we shall produce crossed lines. The lines must be generated parallel or at 45° to the x and y-axes. Other lines cause a problem: a line segment through it starts and finishes at addressable points, may happen to pass through no an...
Read more

DDA and Bresenham's Algorithm

-
Differentiate between DDA Algorithm and Bresenham's Line Algorithm: DDA Algorithm Bresenham's Line Algorithm 1. DDA Algorithm use floating point, i.e., Real Arithmetic. 1. Bresenham's Line Algorithm use fixed point, i.e., Integer Arithmetic 2. DDA Algorithms uses multiplication & division its operation 2.Bresenham's Line Algorithm uses only subtraction and addition its operation 3. DDA Algorithm is slowly than Bresenham's Line Algorithm in line drawing because it uses real arithmetic (Floating Point operation) 3. Bresenham's Algorithm is faster than DDA Algorithm in line because it involves only addition & subtraction in its calculation and uses only integer arithmetic. 4. DDA Algorithm is not accurate and efficient as Bresenham's Line Algorithm. 4. Bresenham's Line Algorithm is more accurate and efficient at DDA Algorithm. 5.DDA Algorithm can draw circle and curves but are not accurate as Bresenham's Line...
Read more

priority&non priority scheduling

-
Image
Priority Scheduling In Priority scheduling, there is a priority number assigned to each process. In some systems, the lower the number, the higher the priority. While, in the others, the higher the number, the higher will be the priority. The Process with the higher priority among the available processes is given the CPU. There are two types of priority scheduling algorithm exists. One is Preemptive priority scheduling while the other is Non Preemptive Priority scheduling. The priority number assigned to each of the process may or may not vary. If the priority number doesn't change itself throughout the process, it is called static priority , while if it keeps changing itself at the regular intervals, it is called dynamic priority . Non Preemptive Priority Scheduling In the Non Preemptive Priority scheduling, The Processes are scheduled according to the priority number assigned to them. Once the process gets scheduled, it will run till the completion. G...
Read more