aboutsummaryrefslogtreecommitdiff
AgeCommit message (Collapse)AuthorFilesLines
2025-10-29feat(array_maker): new file for creating the array structureAndreas Kapp Lindquist1-0/+154
2025-10-29spell(project_spec): Fixed spelling in project_spec filemithe241-5/+5
2025-10-29fix(outputGenerator): fixing pointer problemNavid Samanghoon1-3/+5
2025-10-29chore(Makrfile): Generalized maekfilemithe241-23/+19
2025-10-29chore(snippets): move snippetss to src/mithe244-0/+1
2025-10-29chore(gitignore): gitignore for build/ and sorter exemithe241-0/+2
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-29spell(project_spec): small typomithe241-1/+1
2025-10-29chore(todo): Added todos for argument parsingmithe241-1/+11
2025-10-29refactor(Makefile): Attempt at making MakefileAndreas Kapp Lindquist2-10/+29
2025-10-29feat(utils.s): Added utils from lab sessionsAndreas Kapp Lindquist1-0/+214
2025-10-29chore(numbers.txt): Test file to be sortedAndreas Kapp Lindquist1-0/+10000
2025-10-29feat(makefile): Basic makefileAndreas Kapp Lindquist1-0/+10
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>
2025-10-29chore: Added provided code snippetsmithe243-0/+112
2025-10-29chore: Added project spec filemithe241-0/+99
2025-10-06Add/update/reset filesJakob Lykke Andersen1-0/+15
2025-09-28Initial commitCompArch 251-0/+0