Skip to content

Keycode

More flesh, less fluff.

Tag: Greatest Common Divisor

Greatest Common Divisor (GCD)

int gcd( int a, int b ) {
    return b == 0 ? a : gcd( b, a % b );
}

int gcdOfList( int *list, int num ) {
    int result = list[0];
    for( int i = 1; i < num; ++i ) {
        result = gcd( result, list[i] );
    }
    
    return result;
}
Author pashanhuPosted on 03/09/2019Categories Algorithm, C/C++Tags GCD, Greatest Common DivisorLeave a comment on Greatest Common Divisor (GCD)

Recent Posts

  • Traits and Template Partial Specialisation – 2
  • Traits and Template Partial Specialisation – 1
  • Assert exception during python unit test
  • Resize VirtualBox hard disk capacity
  • Solution to “Another app is currently holding the yum lock; waiting for it to exit”

Recent Comments

No comments to show.
  • September 2022
  • July 2022
  • June 2022
  • April 2022
  • August 2021
  • November 2020
  • October 2020
  • June 2020
  • May 2020
  • February 2020
  • October 2019
  • September 2019
  • August 2019
  • Algorithm
  • Boost
  • C/C++
  • Debug
  • git
  • GitHub
  • Image/Graphics
  • Java
  • Linux
  • Node.js
  • Other
  • Python
  • Qt
  • Swift
Keycode Proudly powered by WordPress