For Lab 4, you will need to write a document in LaTex. I personally would recommend overleaf.com for doing so. If you didn't get an invite to the site either ask one of your classmates to invite you, or simply sign up there. For writing equations, I would advise using an equation editor until you get used to the LaTex syntax.

Link to equation editor: http://www.codecogs.com/latex/eqneditor.php

Your Algorithm: http://rosettacode.org/wiki/Nth_root#Java

It would help to look up the Nth root approximation on youtube in-order to discuss it better in your report.

Here is a template you can use to start your first la_tex document.

https://www.overleaf.com/read/xmfxxfwwmkhw

Good luck.



------------------

This lab builds on your first project and lab 4.

Basically you need to make an a number of arrays of varying sizes  populated by random numbers. For each array you will need to measure is execution time.

To make your life easier, label your arrays by their size and iterate through them. My advice is to have the difference between each array size be a fixed interval. It will make your graphs look much nicer. Say 1 to n arrays where you skip i steps for every iteration.

Once you are done, plot 20 to 30 points on a graph and demonstrate that the algorithm you were testing satisfy it's given time complexity. If that does not work then do more steps and add them  to your graph, otherwise you are doing something wrong.

Algorithm you can use (pick one):

Selection Sort : http://rosettacode.org/wiki/Sorting_algorithms/Selection_sort#J

Insertion Sort : http://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort#Java

Quick sort: http://rosettacode.org/wiki/Sorting_algorithms/Quicksort

-- if you find those hard to write about then do both merge sort and bubble sort- They are in your notes.

-ps: the coding shouldn't  take you more than 20 minutes.