index
:
sorter.git
main
Reimplementation of the GNU Binutils sort utility in x86-64 Assembly.
about
summary
refs
log
tree
commit
diff
log msg
author
committer
range
Age
Commit message (
Expand
)
Author
Files
Lines
2025-10-29
feat(test.s): More numbers and printing using printNum
Andreas Kapp Lindquist
1
-8
/
+31
2025-10-29
fix(insertionsort.s): Address reference and jump to end_while
Andreas Kapp Lindquist
1
-5
/
+5
2025-10-29
fix(insertionsort.s): Wrong syntax for accessing elements
Andreas Kapp Lindquist
1
-7
/
+11
2025-10-29
test(run.sh) simple script for faster testing
Andreas Kapp Lindquist
1
-0
/
+5
2025-10-29
test(test.s): Created simple test file
Andreas Kapp Lindquist
1
-0
/
+29
2025-10-29
refactor(sorting.s): Renamed to sorter.s
Andreas Kapp Lindquist
1
-2
/
+2
2025-10-29
feat(insertionsort.s): Created insertionsorting algorithm
Andreas Kapp Lindquist
1
-0
/
+69
2025-10-29
docs(sorting.s): Made array reference uppercase A
Andreas Kapp Lindquist
1
-6
/
+6
2025-10-29
docs(sorting.s): Added doc for 4th argument
Andreas Kapp Lindquist
1
-1
/
+2
2025-10-29
feat(sorting): Added sorting wrapper function
mithe24
1
-0
/
+38
2025-10-29
chore: Added provided code snippets
mithe24
3
-0
/
+112
2025-10-29
chore: Added project spec file
mithe24
1
-0
/
+99
2025-10-06
Add/update/reset files
Jakob Lykke Andersen
1
-0
/
+15
2025-09-28
Initial commit
CompArch 25
1
-0
/
+0
[prev]