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
/
report
(
unfollow
)
Age
Commit message (
Expand
)
Author
Files
Lines
2025-10-29
test(benchmark.sh): replaced time with perf stat
Andreas Kapp Lindquist
1
-11
/
+5
2025-10-29
report(*): Did some small refactoring, and added pretty plot
Andreas Kapp Lindquist
1
-104
/
+118
2025-10-29
report(Design): New design flowchart
Andreas Kapp Lindquist
2
-0
/
+41
2025-10-29
Updated man page to reflect v1.0.0 program
mithe24
1
-11
/
+26
2025-10-29
report(evaluation): Introductary text before figure done
Andreas Kapp Lindquist
1
-50
/
+49
2025-10-29
test(benchmark.sh): Made benchmark loop over sortingalgorithms
Andreas Kapp Lindquist
1
-15
/
+20
2025-10-29
test(test.sh): test now only runs for insertion sort
Andreas Kapp Lindquist
1
-1
/
+1
2025-10-29
test(generate_test_data.sh): changed sizes
Andreas Kapp Lindquist
1
-1
/
+1
2025-10-29
report(implementation): Quicksort and Insertionsort plot
Andreas Kapp Lindquist
1
-13
/
+21
2025-10-29
feat(main): Support for choosing algorithm as argument
Andreas Kapp Lindquist
1
-5
/
+52
2025-10-29
refactor(quicksort): renamed to qsort to quicksort and added helper function ...
Andreas Kapp Lindquist
1
-6
/
+24
2025-10-29
fix(strcmp): no loop label
Andreas Kapp Lindquist
1
-1
/
+3