You could save yourself some lines in your code, Mystic, by removing the ans variable from your LCM and Reduce functions. Instead of storing the answer into a variable and then resulting that, just result the answer.
| Turing: |
fcn Reduce (whole : int, numerator : int, denominator : int) : string %%% REDUCTION PROCEDURE var num := (denominator * whole) + numerator %% NUMERATOR var den := denominator %% DENOMINATOR var numorden : int if num mod den = 0 then %% IF IT IS A LIKE FRACTION result intstr (num div den) + "/" + "1" end if %% IF IT IS AN UNLIKE FRACTION if den < num then %% IF THE DENOMINATOR IS GREATOR THEN WE TAKE THE GCF FROM DECREASING DENOMINATOR numorden := den elsif den > num then %% VICE VERSA numorden := num end if for decreasing s : numorden .. 1 %% GREATEST COMMON FACTOR if (num mod s = 0) and (den mod s = 0) then numorden := s %% NUM OR DEN NOW BECOMES THE GCF exit end if end for if den > num then %% ANSWERS %% IF IT CANT BE REDUCED MORE THEN result := intstr (num div numorden) + "/" + intstr (den div numorden) elsif den < num then %% IF IT CAN BE REDUCED, EXPRESS IT AS A MIXED FRACTION result := intstr ((num div numorden) div (den div numorden)) + " " + intstr ((num div numorden) - (((num div numorden) div (den div numorden)) * den div numorden)) + "/" + intstr (den div numorden) end if end Reduce %% ENDING THE REDUCE %%%%% Finds the LCM %%%%% fcn LCM (denominator1 : int, denominator2 : int) : int %% Main Function var choice : int %choice detemines whether to start counting from numerator or denominator if denominator1 > denominator2 then choice := denominator1 %if numerator is bigger then choice = numerator elsif denominator1 < denominator2 then choice := denominator2 %elsif it = denominator else choice := denominator1 %% both are equal end if loop exit when (choice mod denominator1 = 0) and (choice mod denominator2 = 0) choice += 1 end loop result choice end LCM %% Lcm Ends |
Also, mixed fractions are ugly. Improper fractions are the way to go.
