diff options
| author | mo khan <mo@mokhan.ca> | 2025-01-22 14:42:53 -0700 |
|---|---|---|
| committer | mo khan <mo@mokhan.ca> | 2025-01-22 14:42:53 -0700 |
| commit | 08fe640cc61a7c587297e079a2d174534fab5ff3 (patch) | |
| tree | e0de439070509f6a7c5dc93226efd32aff6b6da4 /assignments/3-solution.md | |
| parent | 8316a7cc5f2c7a3969aac4706ebb117f2582e1ca (diff) | |
Improve caesar cipher example in assignment 3
Diffstat (limited to 'assignments/3-solution.md')
| -rw-r--r-- | assignments/3-solution.md | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/assignments/3-solution.md b/assignments/3-solution.md index b0a72a8..5101c79 100644 --- a/assignments/3-solution.md +++ b/assignments/3-solution.md @@ -8,11 +8,20 @@ Chapter 6: > 13. Write a complete assembly language program (including all necessary pseudo-ops) that reads in a series of integers, one at a time, and outputs the largest and smallest values. The input will consist of a list of integer values +I wrote the following C code and then used the GNU C Compiler to convert the C +code into Assembly code for my machine. Below is the C code, compiler command, +and final assembly code. + main.c ```c !include assignments/3/main.c ``` +bash +```bash +$ gcc -S -fverbose-asm -02 main.c +``` + main.s ```assembly !include assignments/3/main.s |
