Sorted Lists and Their Implementations Chapter 12 Data

Sorted Lists and Their Implementations Chapter 12 Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Contents • Specifying the ADT Sorted List • Link-Based Implementation • Implementations That Use the ADT List Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Specifying the ADT Sorted List • The ADT sorted list maintains its entries in sorted order. • It is a container of items that determines and maintains order of entries by their values. Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Specifying the ADT Sorted List • • Test whether sorted list is empty. Get number of entries in sorted list. Insert entry into a sorted list. Remove given entry sorted list. Remove entry at given position. Remove all entries. Look at (get) th entry at a given position Get position of a given entry. Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Specifying the ADT Sorted List FIGURE 12 -1 UML diagram for the ADT sorted list Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Specifying the ADT Sorted List • View C++ interface in Listing 12 -1 § Formalizes initial specifications of ADT sorted list • . htm code listing files ADT sorted list can add, remove, or locate must be in the same entry, given entry as argument folder as the. ppt files for these links to work • Sorted list will not allow add or replacement of entry by position Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

A Link-Based Implementation • View header file for link. Sorted. List, Listing 12 -2 • Begin Implementation: Copy Constructor Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

A Link-Based Implementation Method copy. Chain Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

A Link-Based Implementation FIGURE 12 -2 Places to insert strings into a sorted chain of linked nodes Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

A Link-Based Implementation Method insert. Sorted Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

A Link-Based Implementation Private method get. Node. Before Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Implementations That Use the ADT List • Containment • Public inheritance • Private inheritance Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Containment FIGURE 12 -3 An instance of a sorted list that contains a list of its entries Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Containment FIGURE 12 -4 Sorted. List. Has. A is composed of an instance of the class Linked. List View header file source code, Listing 12 -3 Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Containment Constructors Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Containment Destructor Method insert. Sorted Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Containment • Methods is. Empty , get. Length , remove, clear , and get. Entry of ADT sorted list has same specifications as in ADT list • Example, method remove Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Efficiency Issues FIGURE 12 -5 The worst-case efficiencies of ADT list operations for array-based and linkbased implementations Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Efficiency Issues FIGURE 12 -6 The worst-case efficiencies of the ADT sorted list operations when implemented using an instance of the ADT list Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Public Inheritance FIGURE 12 -7 Sorted. List. Is. A as a descendant of Linked. List Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Public Inheritance • View header file, Listing 12 -4 • Implementation – constructors, destructor Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Public Inheritance • Method inserted. Sorted Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Public Inheritance • Method remove. Sorted Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Public Inheritance • Method get. Position Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Public Inheritance • Overridden method insert Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Private Inheritance • View header file for Sorted. List. As. A, Listing 12 -5 • Implementation § Method get. Entry Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

Private Inheritance FIGURE 12 -8 The Sorted. List. As. A class implemented in terms of the Linked. List class Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013

End Chapter 12 Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013