x86 Assembly Language Homework Help

I need two very basic, simple programs for my homework. These are exercises from Kip Irvine's book Assembly Language for x86 Processors.

1: Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers. Write a test program that calls your GCD procedure five times, using the following pairs of integers (5,20) (24,18) (11,7) (432,226) (26,13). After each procedure call, display the GCD.

2: Create an array of randomly ordered integers. Using the Swap procedure below as a tool, write a loop that exchanges each consecutive pair of integers in the array.

Swap PROC USES eax esi edi,



mov esi, pValX

mov edi, pValY

mov eax, [esi]

xchg eax, [edi]

mov [esi], eax



I don't know why it didn't take, but because these are simple programs the budget is $15 each program. Not in the $250 range. Sorry.

Skills: x86/x64 Assembler

See more: write five basic need, simple recursive algorithm, recursive programs, recursive algorithm, programs in c language, gcd 1, finding programs, finding integers, finding gcd, c# assembly, algorithm tool, algorithm help, language programs, c++ homework help, x86, simple assembly language, ProC, language test, homework help\, c assembly

About the Employer:
( 4 reviews ) Chantilly, United States

Project ID: #4493222

1 freelancer is bidding on average $330 for this job


I can help your homework.

$330 USD in 3 days
(0 Reviews)