diff options
Diffstat (limited to 'report/report.tex')
| -rw-r--r-- | report/report.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/report/report.tex b/report/report.tex index 7ef00ba..8989253 100644 --- a/report/report.tex +++ b/report/report.tex @@ -314,10 +314,10 @@ random. We also see that Quicksort behaves as expected with a best-case runtime of $\mathcal O(n\log n)$ when the input is random, and a worst-case runtime of $\mathcal O(n^2)$ when the input is either sorted or reversely sorted. -\subsection{Nonagorithmic factors} +\subsection{Nonalgorithmic factors} Although the asymptotic run times are caused by the algorithms themselves, the total run times are also greatly affected by the concrete implementations -of highly repeated functions. A good example is our old generate_output function, +of highly repeated functions. A good example is our old generateOutput function, which was extremely slow. This function has since been removed and exchanged with a new approach using a buffer. The implementation looped over the sorted list and used 4 write syscalls per coordinate: One for printing x-coordinate, one for |