GCD of Two Numbers program in Assembly Language
Write a Program to find the GCD of Two Numbers in Assembly Language . Program should load two registers with two Numbers and then apply the logic for GCD of two Numbers . GCD of two numbers is performed by dividing the greater number by the smaller number till the remainder is zero. If it is zero, the divisor is the GCD if not the remainder and the divisor of the previous division are the new set of two numbers. The process is repeated by dividing greater of the two numbers by the smaller number till the remainder is zero and GCD is found.
Algorithm for GCD of Two Numbers
Step I : Initialize the data segment.
Step II : Load AX and BX registers with the operands.
Step III : Check if the two numbers are equal. If yes goto step X, else goto step IV.
Step IV : Is number 1 > number 2 ? If yes goto step VI else goto step V.
Step V : Exchange the contents of AX and BX register, such that AX contains the bigger number.
Step VI : Initialize DX register with 00H.
Step VII : Perform the division operation (contents of AX / contents of BX).
Step VIII : Check if there is remainder. If yes goto step IX, else goto step X.
Step IX : Move the remainder into AX register and goto step IV.
Step X : Save the contents of BX as GCD.
Step XI : Display the result.
Step XII : Stop.
GCD of Two Numbers Algorithm Snapshot
Program code for GCD of Two Numbers
|
1 |
.model small <br/> .stack 100 <br/> .data <br/> no1 dw 0120 <br/> no2 dw 0090 <br/> gcd dw 0h <br/> .code <br/> mov ax,@data ; initialize DS <br/> mov ds, ax <br/> mov ax, no1 ; get the first number <br/> mov bx, no2 ; get the second number <br/> again: cmp ax, bx ; check if nos are equal <br/> je endd ; if equal, save the GCD <br/> jb exchg ; if no, <br/> ; is AX ; if yes interchange <br/> l2: mov dx, 0 <br/> div bx ; check if ax is <br/> ; divisible by bx <br/> cmp dx, 0 ; <br/> je endd <br/> mov ax, dx ; mov the remainder <br/> ; as no1 data <br/> jmp again <br/> exchg : xchg ax, bx jmp l2 <br/> endd : mov gcd, bx <br/> mov ch, 04h ; Count of digits to be <br/> ; displayed <br/> mov cl, 04h ; Count to roll by 4 bits <br/> l12: rol bx, cl ; roll bl so that msb <br/> ; comes to lsb <br/> mov dl, bl ; load dl with data <br/> ; to be displayed <br/> and dl, 0fH ; get only lsb <br/> cmp dl, 09 ; check if digit is 0-9 <br/> ; or letter A-F <br/> jbe l4 <br/> add dl, 07 ; if letter add 37H else <br/> ; only add 30H <br/> l4: add dl, 30H <br/> mov ah, 02 ; INT 21H <br/> ; (Display character) <br/> int 21H <br/> dec ch ; Decrement Count <br/> jnz l12 <br/> mov ah, 4ch <br/> int 21h <br/> end |
How to Run this Program
For Running this program you should have installed Tasm on you computer . If you have not installed Tasm yet please install from Here .
C:\programs>tasm gcd.asm
Turbo Assembler Version 3.0 Copyright (c) 1988, 1991 Borland International
Assembling file: gcd.asm
Error messages: None
Warning messages: None
Passes: 1
Remaining memory: 437k
C:\programs>tlink gcd
Turbo Link Version 3.0 Copyright (c) 1987, 1990 Borland International
C:\programs>gcd
001E
Source projectgeek.com
