List Find Largest

This is a pair exercise and must be competed in your tutorial or lab with your partner.

For this activity, you will be looking at a linked list.

Download list.h, or copy it into your current directory on a CSE system by running

$ cp /web/cs1511/17s2/week11/files/list.h .

Make sure you understand the list and node data structures before beginning this task.

Create a file called listFindLargest.c that includes the list.h header file. In it, you should implement listFindLargest, a function which takes a linked list and returns the largest value in the list. It should have this prototype:

int listFindLargest (List l);

You should write your own tests in a separate file; listFindLargest.c should not contain a main.

To run some simple automated tests:

$ 1511 autotest listFindLargest

To run Styl-o-matic:

$ 1511 stylomatic listFindLargest.c
Looks good!

You’ll get advice if you need to make changes to your code.

Submit your work with the give command, like so:

$ give cs1511 wk13_listFindLargest

Or, if you are working from home, upload the relevant file(s) to the wk13_listFindLargest activity on Give Online.