This section will document any updates applied to the project since original release:

• revision #: <description> (DATESTRING)

In this project, we wrap up our singly-linked list implementation by exploring the reverse display and sorting of nodes in a list, along with writing a few application programs to see our list in action.

For this project, we're going to be implementing the following functions:

List *sortlist  (List *, int);          // sort list (according to mode)
void  displayb(List *, int);            // display list in reverse order

In src/list/, you will find 2 new C files:

• sort.c - which will house the list sort function
• displayb.c - which will handle displaying the list backwards

Take a look at the code there. These are the files that contain functions which will be compiled and archived into the node library (liblist.a) we will be using in this and future projects.

Figure out what is going on, make sure you understand it.

In testing/list/unit/, you will find these new files:

• unit-sortlist.c - unit test for sochlist() library function
• unit-displayb.c - unit test for displayb() library function

These are complete runnable programs (when compiled, and linked against the list library, which is all handled for you by the Makefile system in place).

Of particular importance, I want you to take a close look at:

• the source code to each of these unit tests
  • the purpose of these programs is to validate the correct functionality of the respective library functions
  • follow the logic
  • make sure you understand what is going on
  • ask questions to get clarification!
• the output from these programs once compiled and ran
  • analyze the output
  • make sure you understand what is going on
  • ask questions to get clarification!

To be successful in this project, the following criteria must be met:

• Code must compile cleanly (no warnings or errors)
  • all requested functions must be implemented in the related library
• Executed programs must display in a manner similar to provided output
• Processing must be correct based on input given and output requested
• Output must be correct (i.e. the list visualization, where applicable) based on values input
• Code must be nicely and consistently indented (you may use the indent tool)
• Code must be commented
• Track/version the source code in a repository
• Submit a copy of your source code to me using the submit tool (make submit will do this) by the deadline.