Final
This commit is contained in:
@@ -1,7 +0,0 @@
|
||||
## COS235-HW2 ##
|
||||
|
||||
[](https://gitea-actions.nicholaspease.com/latest-log?branch=main)
|
||||
[](https://drone.nicholaspease.com/umaine-npease/COS235-HW2)
|
||||
[](https://wakaapi.nicholaspease.com/summary?interval=any&project=COS235-HW2)
|
||||

|
||||
<hr>
|
||||
Binary file not shown.
@@ -0,0 +1,17 @@
|
||||
COS235 HW2
|
||||
Nicholas Pease
|
||||
1 OCT 2024
|
||||
|
||||
|
||||
Description:
|
||||
|
||||
This program is an implementation of the Collatz conjecture in RISCV assembly. It accepts a 32 bit number and runs the conjecture until it results in 1, where it then exits
|
||||
|
||||
Execution:
|
||||
|
||||
This program requires RARS (https://github.com/TheThirdOne/rars) and JDK.
|
||||
|
||||
To execute the program with RARS, run the following command
|
||||
java -jar rars1_6.jar hw.s
|
||||
|
||||
With rars1_6 being the current version of RARS and in the same directory as the file
|
||||
@@ -1,6 +1,6 @@
|
||||
# COS235 - HW2
|
||||
# Nicholas Pease
|
||||
# 30 SEP 24
|
||||
# 1 OCT 2024
|
||||
|
||||
.data
|
||||
inputUInt: .space 32
|
||||
Reference in New Issue
Block a user