Nate's Work - Thu Feb 22

Worked through chapter 2 on big O notation here: http://interactivepython.org/runestone/static/pythonds/index.html
Did the example problem in c and python that asked for a program calculating the minimum value of an array with an algorithm at O(n2) and O(n) linearvsquadratic
Updated my sorting algorithms with comments and new functionality
My sorting algorithms now take user input for number of arrays and size of arrays then populate a given number of arrays with a given number of random integers, they then output the code to a text file rather than printing them on the console.
Included are the text outputs of each sorting algorithm for 100 arrays length 100, 1000, and 10000.

Jim says

In my office I went over some C syntax and idea. The code we generated is in the jim_feb22/ folder, in the attachments below.

I suggested

putting a short comment header at the top of each file
averaging the times within the C program
re-using the common pieces i.e. random numbers, timing, perhaps by passing in which function as an argument
... and/or by breaking this into several files
... and/or by using unix file pipes and redirection "./program > output.txt"

I also went over linked lists, using the code from my words4.c as an example.