Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Fix #3 #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
sql-hkr merged 1 commit into from
Oct 22, 2025
Merged

Fix #3 #4

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -103,9 +103,9 @@ inner_loop:
ldi r23, 1
add r22, r23
ld r24, r22 ; r24 = B
; compare A and B (we'll swap if A > B)
cp r24, r21 ; sets carry if r24 < r21 (unsigned)
brcs no_swap ; branch if carry set => r24 < r21 => A > B? (keep original order)
; compare A and B (we'll swap if A < B)
cp r21, r24 ; sets carry if r21 < r24
brcs no_swap
; swap A and B: store B into A's address, A into B's address
st r20, r24
st r22, r21
Expand Down
6 changes: 3 additions & 3 deletions docs/examples/bubblesort.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -55,9 +55,9 @@ This example demonstrates a simple bubble sort algorithm implemented in assembly
ldi r23, 1
add r22, r23
ld r24, r22 ; r24 = B
; compare A and B (we'll swap if A > B)
cp r24, r21 ; sets carry if r24 < r21 (unsigned)
brcs no_swap ; branch if carry set => r24 < r21 => A > B? (keep original order)
; compare A and B (we'll swap if A < B)
cp r21, r24 ; sets carry if r21 < r24
brcs no_swap
; swap A and B: store B into A's address, A into B's address
st r20, r24
st r22, r21
Expand Down
6 changes: 3 additions & 3 deletions examples/bubblesort.asm
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,9 +44,9 @@ inner_loop:
ldi r23, 1
add r22, r23
ld r24, r22 ; r24 = B
; compare A and B (we'll swap if A > B)
cp r24, r21 ; sets carry if r24 < r21 (unsigned)
brcs no_swap ; branch if carry set => r24 < r21 => A > B? (keep original order)
; compare A and B (we'll swap if A < B)
cp r21, r24 ; sets carry if r21 < r24
brcs no_swap
; swap A and B: store B into A's address, A into B's address
st r20, r24
st r22, r21
Expand Down