This MASM program demonstrates the use of procedures (functions) as well as printing different colors to console.

This is my first attempt a prime sieve in assembly. It is largely a direct translation from a Sieve of Eratosthenes originally written in Java, so this program is not exactly optimally structured. Firstly, it stores all primes up to n in an array. Secondly, it counts the number of primes before n and stores that hexadecimal value in the EAX register. This is rough. There is much room for improvement, and I intend to revisit this program without using the MUL function.

This is my first x86 MASM program. As the title states, this program outputs a Fibonacci number that corresponds to an input value of n. I'm not happy with its current state because it is constantly swapping between the memory and registers.