Mazdak Farrokhzad edited stuff.tex  about 10 years ago

Commit id: 9db7f0692529cb0636e54ee012c1af86b98294aa

deletions | additions      

       

\documentclass{article}  \usepackage{graphicx}  \usepackage{latexsym}  \usepackage{amsfonts,amsmath,amssymb}  \usepackage{url}  \usepackage[utf8]{inputenc}  \usepackage{fancyref}  \usepackage{hyperref}  \hypersetup{colorlinks=false,pdfborder={0 0 0},}    \usepackage{parskip}  \usepackage{tikz}  \usepackage{pgfplots}  \usepackage{filecontents}  \usepackage{listings}  \begin{document}  \title{Algorithms - Lab 1, Problem 1}  \author{Mazdak Farrokhzad\\ Chalmers University of Technology \and Niclas Alexandersson\\ Chalmers University of Technology}  \date{\today}  \bibliographystyle{plain}  \maketitle   \section{Introduction}  This hand in deals with complexity analysis of an algorithm $prime(n)$