List Is Ordered

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 listIsOrdered.c that includes the list.h header file. In it, you should implement listIsOrdered, a function which takes a linked list, and returns TRUE if the list is in ascending order (where each element is greater than or equal to the previous node), FALSE otherwise. It should have this prototype:

int listIsOrdered (List l);

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

To run some simple automated tests:

$ 1511 autotest listIsOrdered

To run Styl-o-matic:

$ 1511 stylomatic listIsOrdered.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 wk11_listIsOrdered

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