Today in class we will share our implementations of the functions assigned last class.

Read Section 6.3: Circular Linked Lists (pages 180 to 184). Take notes and make sure you feel you have a solid understanding of the abstractions (i.e. the diagrams) discussed in the section. Take a look at the code on pages 184 to 188, but with an eye toward thinking about what functions we will want to add (using TDD) to our library next class.

We will begin class by installing Nate's ctest. I'll show you how to setup your environment so that you can both use and update ctest as Nate makes changes to it.

Start with this code, we will pair up to implement the following functions:

• list_length
• print_list
• find_in_list
• insert_at_end
• insert_in_order
• remove_from_list

This work will be divided as follows:

• Julissa and Nate will write list_length and print_list.
• Joseph and Sheel will write find_in_list and insert_at_end.
• Cyrus and Edward will write insert_in_order and remove_from_list.

Working with your partner, use TDD to first design a test, then write code to make your test pass until you have robust implimentations of your assigned function. We will share our solutions and assembly them together in class on Thursday.