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
path:
root
/
src
(
follow
)
Age
Commit message (
Expand
)
Author
Files
Lines
2025-10-29
**JANITOR** removed orphans
mithe24
3
-325
/
+0
2025-10-29
fix(main): used make_array_from_file
Andreas Kapp Lindquist
1
-6
/
+5
2025-10-29
fix(outputGenerator)
Andreas Kapp Lindquist
1
-7
/
+7
2025-10-29
feat(array_maker): new file for creating the array structure
Andreas Kapp Lindquist
1
-0
/
+154
2025-10-29
fix(outputGenerator): fixing pointer problem
Navid Samanghoon
1
-3
/
+5
2025-10-29
chore(snippets): move snippetss to src/
mithe24
4
-0
/
+327
2025-10-29
fix(outputGenerator.s): renamed printNum to print_num
Andreas Kapp Lindquist
1
-11
/
+11
2025-10-29
feat(main.s): basic file sorter rutine
Andreas Kapp Lindquist
1
-1
/
+13
2025-10-29
docs(file_parser): return type
Andreas Kapp Lindquist
1
-2
/
+2
2025-10-29
feat(file_parser): return length of array in rdx
Andreas Kapp Lindquist
1
-1
/
+3
2025-10-29
feat(outputGenerator.s): suggestion to how we print the sorted buffer
Navid Samanghoon
1
-0
/
+142
2025-10-29
feat(main.s): Created basic main file
Andreas Kapp Lindquist
1
-0
/
+17
2025-10-29
feat(file_parser.s): Function for parsing file into array format
Andreas Kapp Lindquist
1
-0
/
+58
2025-10-29
feat(coordinateManager): file with functions regarding making a pointer buffer
Navid Samanghoon
1
-0
/
+51
2025-10-29
refactor(run.sh,test.s,utils.s): Removed test files
Andreas Kapp Lindquist
3
-272
/
+0
2025-10-29
docs(insertion_sort.s)
Andreas Kapp Lindquist
1
-2
/
+2
2025-10-29
refactor(insertionsort.s): Renamed to insertion_sort.s
Andreas Kapp Lindquist
2
-2
/
+2
2025-10-29
fix(insertionsort.s): Save array size across recursive call
Andreas Kapp Lindquist
1
-2
/
+2
2025-10-29
docs(insertionsort.s): Added reference for algorithm
Andreas Kapp Lindquist
1
-1
/
+2
2025-10-29
feat(utils.s): Added printNum function for testing
Andreas Kapp Lindquist
2
-1
/
+216
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