From 6d786392ec227d2a19c7f01617443e7e4f07d318 Mon Sep 17 00:00:00 2001
From: Navid Samanghoon <nsama24@student.sdu.dk>
Date: Tue, 21 Oct 2025 18:15:02 +0200
Subject: branch for writing the report

---
 report/report.tex | 13 +++++++++++++
 1 file changed, 13 insertions(+)

(limited to 'report/report.tex')

diff --git a/report/report.tex b/report/report.tex
index 925b17f..33b7495 100644
--- a/report/report.tex
+++ b/report/report.tex
@@ -37,6 +37,19 @@
 \newpage
 
 \section{Introduction}
+Sorting is one of the most fundamental operations in programming. Sorting algorithms play a crucial role
+in efficient searching, organization and interpretation of data, and optimization problems. Furthermore,
+sorting is often times the first step towards designing complicated algorithms in computer science. This
+project aims to study efficient sorting of a list of coordinates by the second value of each coordinate,
+in Assembly. Although abstract high level languages such as Python and Java allow faster and convenient development,
+Assembly provides precise control over program flow, memory usage and instruction level execution, making Assembly an excellent
+evironment for benchmarking and performance analysis. In this project the two algorithms quick-sort and insertion-sort
+will be implemented and compared against each other. Quick-sort is expected to excel on large random datasets,
+while insertion-sort is more suitable for small or nearly sorted cases.
+Several test
+instances consisting of uniformly random coordinates will be created with the goal of comparing the implementations
+actual runtime to their theoretical runtimes. These datasets will be ranging from 10,000 to 5,000,000 elements, including edge
+cases with duplicates or nearly sorted lists.
 \section{Design}
 \section{Implementation}
 \section{Evaluation}
-- 
cgit v1.2.3-70-g09d2

