diff --git a/Socksorting/bibliography.bib b/Socksorting/bibliography.bib index da9de81..81e80bd 100644 --- a/Socksorting/bibliography.bib +++ b/Socksorting/bibliography.bib @@ -1,7 +1,7 @@ -@article{My colleague et al., - title={A first approach to sock sorting}, - journal={Journal of laundry science}, - author={My colleague et al.}, - year={1969}, - month={13} - } +@article{otherarticle, + title = {A first approach to sock sorting}, + journal = {Journal of laundry science}, + author = {My colleague et al.}, + year = {1969}, + month = {13} +} diff --git a/Socksorting/defs.tex b/Socksorting/defs.tex index 48578d2..e73e66e 100644 --- a/Socksorting/defs.tex +++ b/Socksorting/defs.tex @@ -44,7 +44,7 @@ % Bibliography -\usepackage[backend=biber]{biblatex} +\usepackage[backend=biber,style=alphabetic,sorting=ynt]{biblatex} \DefineBibliographyStrings{english}{andothers={+}} diff --git a/Socksorting/main.pdf b/Socksorting/main.pdf index 320213d..87fbd20 100644 Binary files a/Socksorting/main.pdf and b/Socksorting/main.pdf differ diff --git a/Socksorting/project.tex b/Socksorting/project.tex index 7952d44..22c7012 100644 --- a/Socksorting/project.tex +++ b/Socksorting/project.tex @@ -69,7 +69,7 @@ $n$ being the number of items currently inside the basket. To fully appreciate the gravity of \acronym it has to first be discussed how most resent research tackles the problem of sock sorting. The following code describes the most recently developed sock sorting -algorithm from the paper by \citeauthor{My colleague et al.} Which is the current +algorithm from the paper by my colleague which is the current industry standard. Notice the code has a runtime complexity of $\mathcal{O}(n^2)$. \begin{algorithm} @@ -197,8 +197,5 @@ research and personal advancement.\\ It is also only appropriate to thank the air. Without it no laundry would be dry and we would not have written this paper.\\ -\begingroup -\setlength\bibitemsep{0pt} -\setlength\bibnamesep{0pt} -\printbibliography[heading=subbibliography] -\endgroup + +\printbibliography[]