Write a program in Assembly Language to find the maximum number and the minimum number from an array of ten positive numbers. Store the minimum number in AX and maximum number in DX. [Hint: Use the conditional jumps]
This is easy (the 2nd mystery question completely baffled me though; I suggest you check back through your course notes and see where they've shown you how to do this for other things, and apply that knowledge). But we won't do your homework for you. Have a go and when you get stuck post your code and let us know what the problem is.
