PageRenderTime 538ms CodeModel.GetById 20ms RepoModel.GetById 0ms app.codeStats 0ms

/trunk/Examples/ocaml/argout_ref/example.c

#
C | 19 lines | 15 code | 2 blank | 2 comment | 1 complexity | c70f6a122c6778d65541b8e6028684e1 MD5 | raw file
Possible License(s): LGPL-2.1, Cube, GPL-3.0, 0BSD, GPL-2.0 
    

  1. /* File : example.c */
    2. 

  2. 

  3. /* Compute the greatest common divisor of positive integers */
    4. 

  4. int gcd(int x, int y) {
    5. 

  5.   int g;
    6. 

  6.   g = y;
    7. 

  7.   while (x > 0) {
    8. 

  8.     g = x;
    9. 

  9.     x = y % x;
    10. 

  10.     y = g;
    11. 

  11.   }
    12. 

  12.   return g;
    13. 

  13. }
    14. 

  14. 

  15. extern "C" void factor( int &x, int &y ) {
    16. 

  16.     int gcd_xy = gcd( x,y );
    17. 

  17.     x /= gcd_xy;
    18. 

  18.     y /= gcd_xy;
    19. 

  19. }
    20. 

  20.