Skip to content

Commit 5bf2fe7

Browse files
committed
comment section is fixed
1 parent 2e7fa35 commit 5bf2fe7

File tree

1 file changed

+8
-11
lines changed

1 file changed

+8
-11
lines changed

Experiment - 3/part2.asm

Lines changed: 8 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -1,18 +1,15 @@
1-
/*
2-
In this code:
1+
;----------------------------------------------
2+
; R8 is initialized as the current number (starting from 1).
33

4-
R8 is initialized as the current number (starting from 1).
4+
; R9 is used to keep track of the count of divisible numbers.
55

6-
R9 is used to keep track of the count of divisible numbers.
6+
; The findNumbers loop checks if the current number is divisible by 3 or 4 using the modulus operation
7+
; and stores it in the array if it is.
78

8-
The findNumbers loop checks if the current number is divisible by 3 or 4 using the modulus operation
9-
and stores it in the array if it is.
10-
11-
This code will populate the arr array with the first 50 positive numbers that are divisible by either 3 or 4.
12-
13-
You can modify the code to use a different array size or to store the numbers in a different memory location if needed.
14-
*/
9+
; This code will populate the arr array with the first 50 positive numbers that are divisible by either 3 or 4.
1510

11+
; You can modify the code to use a different array size or to store the numbers in a different memory location if needed.
12+
;----------------------------------------------
1613

1714
; Initialize registers
1815
main mov.w #arr, R10 ; Set R10 to the address of the array

0 commit comments

Comments
 (0)