algorithm tobinary( pren > postn has been converted into its base representation while list add( / end while return reverse(list end tobinary list { table algorithm trace of tobinary attaining the greatest common denominator of two numbers fairly routine problem in mathematics is that of finding the greatest common denominator of two integerswhat we are essentially after is the greatest number which is multiple of bothe the greatest common denominator of and is one of the most elegant solutions to this problem is based on euclid' algorithm that has run time complexity of ( algorithm greatestcommondenominator(mn prem and are integers postthe greatest common denominator of the two integers is calculated if return end if return greatestcommondenominator(nm end greatestcommondenominator