IUP Computer Science
COSC 300 Fall 1999

Quiz #4
(Due in class 22 November 1999)

Write a macro named MIN which can find the smallest value in an array of almost any type. You may assume that the array contains at least one entry. If a program contains these storage areas:

CHUNK:	.BLKW	50
CSIZE:	.BLKL	1
REALS:	.BLKF	4000
RSIZE:	.BLKL	1
where CHUNK and REALS are arrays and CSIZE and RSIZE contain the number of used elements in each array respectively, the MIN macro should handle invocations like:
MIN    CHUNK, CSIZE, R10, W		; Put smallest in R10

MIN    REALS, RSIZE, SMALL, F		; Put smallest in SMALL