aboutsummaryrefslogtreecommitdiff
path: root/src (follow)
AgeCommit message (Collapse)AuthorFilesLines
2025-10-29chore(main): Removed redindant labelAndreas Kapp Lindquist1-2/+3
2025-10-29refactor(src): made sure all function follow calling conventionsAndreas Kapp Lindquist6-18/+8
2025-10-29Updated man page to reflect v1.0.0 programmithe241-11/+26
2025-10-29feat(main): Support for choosing algorithm as argumentAndreas Kapp Lindquist1-5/+52
2025-10-29refactor(quicksort): renamed to qsort to quicksort and added helper function ↵Andreas Kapp Lindquist1-6/+24
for better interface
2025-10-29fix(strcmp): no loop labelAndreas Kapp Lindquist1-1/+3
2025-10-29strcmp for parsing command line argumentsmithe241-0/+34
2025-10-29I can't manually find the error in the output, yet check.py failsmithe242-58/+70
2025-10-29fix(qsort): Quicksort errors. And why is length 1-indexed :(mithe242-45/+36
2025-10-29fix(printing & int2str): Better printing and int to string funcmithe245-156/+179
2025-10-29Working qsort I thinkmithe242-1/+118
So far looks like it is working, cannot be tested with 'test.sh' since quick sort is not a stable sorting algorithm
2025-10-29update: Improved code readability and clarity by refining commentsNavid Samanghoon4-51/+73
2025-10-29This is leftover trashmithe241-39/+0
2025-10-29fix(test): the test used an unstable sorting algorithm, which caused ↵Navid Samanghoon1-1/+1
insertion sort to fail on duplicates. This has been fixed now.
2025-10-29typoNavid Samanghoon2-2/+2
2025-10-29fix(insertion_sort): uses 2 loops nowNavid Samanghoon1-45/+43
2025-10-29feat(man page): Added man page for programmithe242-1/+24
2025-10-29build(fix): Removed old variable, fixed wrong commandmithe241-3/+1
2025-10-29build(version numbering): Added support for automatic version numberingmithe241-1/+2
Added support for automatic version numbering using git version tags
2025-10-29build: Move Makefile to src/ and putting object files in src/ toomithe241-0/+27
Changed output directory for objects files and put Makefile in src/. This is because that is how it's expected in desc.pdf
2025-10-29**JANITOR** removed orphansmithe243-325/+0
2025-10-29fix(main): used make_array_from_fileAndreas Kapp Lindquist1-6/+5
2025-10-29fix(outputGenerator)Andreas Kapp Lindquist1-7/+7
2025-10-29feat(array_maker): new file for creating the array structureAndreas Kapp Lindquist1-0/+154
2025-10-29fix(outputGenerator): fixing pointer problemNavid Samanghoon1-3/+5
2025-10-29chore(snippets): move snippetss to src/mithe244-0/+327
2025-10-29fix(outputGenerator.s): renamed printNum to print_numAndreas Kapp Lindquist1-11/+11
2025-10-29feat(main.s): basic file sorter rutineAndreas Kapp Lindquist1-1/+13
2025-10-29docs(file_parser): return typeAndreas Kapp Lindquist1-2/+2
2025-10-29feat(file_parser): return length of array in rdxAndreas Kapp Lindquist1-1/+3
2025-10-29feat(outputGenerator.s): suggestion to how we print the sorted bufferNavid Samanghoon1-0/+142
2025-10-29feat(main.s): Created basic main fileAndreas Kapp Lindquist1-0/+17
2025-10-29feat(file_parser.s): Function for parsing file into array formatAndreas Kapp Lindquist1-0/+58
2025-10-29feat(coordinateManager): file with functions regarding making a pointer bufferNavid Samanghoon1-0/+51
2025-10-29refactor(run.sh,test.s,utils.s): Removed test filesAndreas Kapp Lindquist3-272/+0
2025-10-29docs(insertion_sort.s)Andreas Kapp Lindquist1-2/+2
2025-10-29refactor(insertionsort.s): Renamed to insertion_sort.sAndreas Kapp Lindquist2-2/+2
2025-10-29fix(insertionsort.s): Save array size across recursive callAndreas Kapp Lindquist1-2/+2
2025-10-29docs(insertionsort.s): Added reference for algorithmAndreas Kapp Lindquist1-1/+2
2025-10-29feat(utils.s): Added printNum function for testingAndreas Kapp Lindquist2-1/+216
2025-10-29feat(test.s): More numbers and printing using printNumAndreas Kapp Lindquist1-8/+31
2025-10-29fix(insertionsort.s): Address reference and jump to end_whileAndreas Kapp Lindquist1-5/+5
2025-10-29fix(insertionsort.s): Wrong syntax for accessing elementsAndreas Kapp Lindquist1-7/+11
2025-10-29test(run.sh) simple script for faster testingAndreas Kapp Lindquist1-0/+5
2025-10-29test(test.s): Created simple test fileAndreas Kapp Lindquist1-0/+29
2025-10-29refactor(sorting.s): Renamed to sorter.sAndreas Kapp Lindquist1-2/+2
2025-10-29feat(insertionsort.s): Created insertionsorting algorithmAndreas Kapp Lindquist1-0/+69
2025-10-29docs(sorting.s): Made array reference uppercase AAndreas Kapp Lindquist1-6/+6
2025-10-29docs(sorting.s): Added doc for 4th argumentAndreas Kapp Lindquist1-1/+2
2025-10-29feat(sorting): Added sorting wrapper functionmithe241-0/+38
Sorting wrapper function sorts array a, with references to arrays a_i, based on the given key in a_i, address and size of a. Co-authered: Andreas Kapp Lindquist <andkaplin05@gmail.com>