Finding Greatest Common Divisor – Assembly Language Example USING MASM

May 30, 2012 7:45 pmLeave a Comment

This is a small program in Intel Assembly Language that finds the Greatest Common Divisor for any two integers and is comparable to the following C++ code:

The following is the implementation in Intel Assembly Language:

Posted in A bit 'Experts', ProgrammingTagged , , , , , , ,

Leave a Reply

Your email address will not be published. Required fields are marked *

*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>